{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T23:36:23Z","timestamp":1777937783315,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0377-2217(03)00261-3","type":"journal-article","created":{"date-parts":[[2003,11,13]],"date-time":"2003-11-13T11:44:27Z","timestamp":1068723867000},"page":"534-543","source":"Crossref","is-referenced-by-count":122,"title":["Minimizing the makespan for the flow shop scheduling problem with availability constraints"],"prefix":"10.1016","volume":"153","author":[{"given":"Riad","family":"Aggoune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00261-3_BIB1","article-title":"Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability","author":"Blazewicz","year":"2000","journal-title":"Bulletin of the Polish Academy of Sciences, Technical Sciences"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB2","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","article-title":"Heuristic algorithms for the two-machine flowshop problem with limited machine availability","volume":"29","author":"Blazewicz","year":"2001","journal-title":"Omega Journal"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB3","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n job m machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0167-6377(00)00033-X","article-title":"An improved heuristic for the two-machine flowshop scheduling with an availability constraint","volume":"26","author":"Cheng","year":"2000","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/S0360-8352(99)00127-8","article-title":"Minimizing the makespan in the two-machine no-wait flow-shop","volume":"37","author":"Espinouse","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user\u2019s guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB8","unstructured":"F. Glover, Tabu search fundamentals and uses, Revised and Expanded, Technical Report, Graduate School of Business, University of Colorado, Boulder, CO, 1995"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB9","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1002\/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#","article-title":"Scheduling maintenance and semiresumable jobs on a single machine","volume":"46","author":"Graves","year":"1999","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB10","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB11","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","article-title":"Two-machine flow shops with limited machine availability","volume":"136","author":"Kubiak","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","article-title":"Machine scheduling with an availability constraint","volume":"9","author":"Lee","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","article-title":"Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint","volume":"20","author":"Lee","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB14","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","article-title":"Two-machine flowshop scheduling with availability constraints","volume":"114","author":"Lee","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3","article-title":"Scheduling jobs and maintenance activities on parallel machines","volume":"47","author":"Lee","year":"2000","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB16","series-title":"Scheduling: Theory Algorithm, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB17","unstructured":"M.-C. Portmann, Genetic algorithms and scheduling a state of the art and some propositions, in: Proceedings of the Workshop on Production Planning and Control, Mons, Belgium, 1996"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Research"},{"key":"10.1016\/S0377-2217(03)00261-3_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","article-title":"Scheduling with limited machine availability","volume":"121","author":"Schmidt","year":"2000","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002613?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002613?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:00:23Z","timestamp":1550379623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0377221703002613"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00261-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}