{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T04:50:41Z","timestamp":1777524641420,"version":"3.51.4"},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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,12]]},"DOI":"10.1016\/s0377-2217(03)00434-x","type":"journal-article","created":{"date-parts":[[2003,10,22]],"date-time":"2003-10-22T08:20:53Z","timestamp":1066810853000},"page":"651-662","source":"Crossref","is-referenced-by-count":97,"title":["A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation"],"prefix":"10.1016","volume":"159","author":[{"given":"S.","family":"Bertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-C.","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00434-X_BIB1","unstructured":"S. Bertel, Probl\u00e8mes d'ordonnancement dans un flowshop hybride avec recirculation sous contrainte de gestion de personnel, Ph.D. Thesis, University of Tours, Tours, France, December 2001 (in French)"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB2","unstructured":"S. Bertel, J.-C. Billaut, Configuration and scheduling problems in an industrial flowshop, in: International Conference on Industrial Engineering and Production Management (IEPM'99), vol. 1\/2, Glascow, Scotland, July 1999, pp. 448\u2013456"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","article-title":"A generalized permutation approach to job scheduling with genetic algorithms","volume":"17","author":"Bierwirth","year":"1995","journal-title":"OR Spektrum"},{"issue":"1","key":"10.1016\/S0377-2217(03)00434-X_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","article-title":"A state-of-the-art survey of dispatching rules for manufacturing job shop operations","volume":"20","author":"Blackstone","year":"1982","journal-title":"International Journal of Production Research"},{"issue":"4","key":"10.1016\/S0377-2217(03)00434-X_BIB5","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/09537289608930364","article-title":"A comparative analysis of due date based job sequencing rules in a flowshop with multiple processors","volume":"7","author":"Brah","year":"1996","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB6","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","article-title":"Branch and bound algorithm for the flow shop with multiple processors","volume":"51","author":"Brah","year":"1991","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/02522667.1991.10699055","article-title":"Mathematical modeling of scheduling problems","volume":"12","author":"Brah","year":"1991","journal-title":"Journal of Information and Optimization Sciences"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB8","series-title":"Advances in Optimization and Approximation","article-title":"Scheduling multiprocessor flowshops","author":"Chen","year":"1994"},{"issue":"1","key":"10.1016\/S0377-2217(03)00434-X_BIB9","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","article-title":"Minimizing late jobs in the general one machine scheduling problem","volume":"81","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/S0377-2217(03)00434-X_BIB10","first-page":"5140B","article-title":"An analysis of the behavior of a class of genetic adaptative systems","volume":"36","author":"De Jong","year":"1977","journal-title":"Dissertation Abstracts International"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB11","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0377-2217(97)00194-X","article-title":"Flowshop scheduling with identical jobs and uniform parallel machines","volume":"109","author":"Dessouky","year":"1998","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(03)00434-X_BIB12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two-stage hybrid flowshop scheduling problems","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of Operational Research Society"},{"issue":"9","key":"10.1016\/S0377-2217(03)00434-X_BIB13","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1080\/002075498192599","article-title":"Minimizing tardy jobs in a two-stage hybrid flowshop","volume":"36","author":"Gupta","year":"1998","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0167-6377(97)00004-7","article-title":"Heuristic algorithms for the two-stage hybrid flowshop problem","volume":"21","author":"Haouari","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB15","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0377-2217(89)90107-0","article-title":"A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop","volume":"38","author":"Hariri","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB16","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0377-2217(96)90070-3","article-title":"Preemptive scheduling in a two-stage multiprocessor flow shop is strongly NP-hard","volume":"89","author":"Hoogeveen","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(03)00434-X_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0483(92)90057-E","article-title":"Performance of priority rules in a due date flow shop","volume":"20","author":"Hunsucker","year":"1992","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(94)90333-6","article-title":"Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment","volume":"72","author":"Hunsucker","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","article-title":"A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","volume":"26","author":"Lawler","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","article-title":"Hybrid flowshop scheduling: A survey","volume":"37","author":"Linn","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB22","first-page":"113","article-title":"A branch and bound algorithm for the hybrid flowshop","volume":"64","author":"Moursli","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0377-2217(99)00354-9","article-title":"Local search algorithms for the multiprocessor flow shop scheduling problem","volume":"128","author":"Negenman","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB24","unstructured":"E. N\u00e9ron, P. Baptiste, J. Carlier, C. Le Pape, Global operations for the multiprocessor flowshop, in: 6th International Workshop on Project Management and Scheduling, Istanbul, Turkey, July 1998, pp. 248\u2013251"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB25","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","article-title":"The flow shop with parallel machines: A tabu search approach","volume":"106","author":"Nowicki","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"25","author":"Panwalkar","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB27","series-title":"Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB28","series-title":"Ordonnancement de la Production","article-title":"Algorithmes g\u00e9n\u00e9tiques et ordonnancement","author":"Portmann","year":"2001"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","article-title":"A state-of-art survey of static scheduling research involving due dates","volume":"12","author":"Sen","year":"1984","journal-title":"OMEGA"},{"issue":"6","key":"10.1016\/S0377-2217(03)00434-X_BIB30","first-page":"271","article-title":"Application des algorithmes g\u00e9n\u00e9tiques aux flowshops hybrides","author":"Soukhal","year":"1999","journal-title":"Revue des Sciences et Technologie (Algeria)"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB31","unstructured":"A. Soukhal, P. Martineau, Evaluation de performances d'op\u00e9rateurs de croisement et de mutation dans les algorithmes g\u00e9n\u00e9tiques appliqu\u00e9s \u00e0 la r\u00e9solution des probl\u00e8mes d'ordonnancement, Technical Report no. 242, Laboratoire d'lnformatique, University of Tours, Tours, France, January 2001 (in French)"},{"key":"10.1016\/S0377-2217(03)00434-X_BIB32","unstructured":"G. Ulusoy, F. Sivrikaya-Serifoglu. A genetic algorithm approach for hybrid flow-shops, in: 6th International Workshop on Project Management and Scheduling, Istanbul, Turkey, July 1998, p. 313"},{"issue":"2","key":"10.1016\/S0377-2217(03)00434-X_BIB33","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1051\/ro:1999108","article-title":"Les flowshop hybrides: \u00c9tat de 1'art","volume":"33","author":"Vignier","year":"1999","journal-title":"RAIRO\/RO"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170300434X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170300434X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T04:27:16Z","timestamp":1550550436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170300434X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S037722170300434X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00434-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}