Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Aydilek, Harun, Allahverdi, Ali (2010) Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59. 684-693 doi:10.1016/j.camwa.2009.10.025

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleTwo-machine flowshop scheduling problem with bounded processing times to minimize total completion time
JournalComputers & Mathematics with Applications
AuthorsAydilek, HarunAuthor
Allahverdi, AliAuthor
Year2010 (January)Volume59
PublisherElsevier BV
DOIdoi:10.1016/j.camwa.2009.10.025Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6573567Long-form Identifiermindat:1:5:6573567:7
GUID0
Full ReferenceAydilek, Harun, Allahverdi, Ali (2010) Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59. 684-693 doi:10.1016/j.camwa.2009.10.025
Plain TextAydilek, Harun, Allahverdi, Ali (2010) Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59. 684-693 doi:10.1016/j.camwa.2009.10.025
In(n.d.) Computers & Mathematics with Applications Vol. 59. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Allahverdi, Ali, Aydilek, Harun (2010) Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Computers & Mathematics with Applications, 60. 1374-1384 doi:10.1016/j.camwa.2010.06.019
Mosheiov, Gur, Sarig, Assaf (2009) Scheduling a maintenance activity to minimize total weighted completion-time. Computers & Mathematics with Applications, 57. 619-623 doi:10.1016/j.camwa.2008.11.008
Yang, Suh-Jenq, Yang, Dar-Li (2010) Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities. Computers & Mathematics with Applications, 60. 2161-2169 doi:10.1016/j.camwa.2010.08.003
Kuo, Wen-Hung, Yang, Dar-Li (2007) Single-machine scheduling problems with start-time dependent processing time. Computers & Mathematics with Applications, 53. 1658-1664 doi:10.1016/j.camwa.2006.07.012
Xie, Jinxing, Wang, Xijun (2005) Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints. Computers & Mathematics with Applications, 50. 1629-1638 doi:10.1016/j.camwa.2005.07.008
Lee, Wen-Chiung, Lai, Peng-Jen, Wu, Chin-Chia (2011) Some single-machine and flowshop scheduling problems with a non-linear deterioration function. Computers & Mathematics with Applications, 62. 2487-2496 doi:10.1016/j.camwa.2011.07.037
Bogdanović, Milena (2010) An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem. Computers & Mathematics with Applications, 59. 3029-3038 doi:10.1016/j.camwa.2010.02.021
Wan, Long, Yuan, Jinjiang (2018) Single-machine scheduling with operator non-availability to minimize total weighted completion time. Information Sciences, 445. 1-5 doi:10.1016/j.ins.2018.03.005
Ma, Ran, Yuan, Jinjiang (2013) Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Information Processing Letters, 113 (17) 593-598 doi:10.1016/j.ipl.2013.05.006
Fang, Yang, Lu, Xiwen (2016) Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine. Information Processing Letters, 116 (8) 526-531 doi:10.1016/j.ipl.2016.03.010
Liefooghe, Arnaud, Basseur, Matthieu, Humeau, Jérémie, Jourdan, Laetitia, Talbi, El-Ghazali (2012) On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. Computers & Mathematics with Applications, 64. 3747-3762 doi:10.1016/j.camwa.2012.02.051
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: August 30, 2025 16:32:22
Go to top of page