{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:07:28Z","timestamp":1771880848920,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":[[1998,6]]},"DOI":"10.1016\/s0377-2217(97)00333-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:48:22Z","timestamp":1027604902000},"page":"389-400","source":"Crossref","is-referenced-by-count":94,"title":["Branch and bound crossed with GA to solve hybrid flowshops"],"prefix":"10.1016","volume":"107","author":[{"given":"M.-C.","family":"Portmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vignier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Dardilhac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Dezalay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0377-2217(97)00333-0_BIB1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two-stage hybrid flowshop scheduling problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB2","unstructured":"J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Minimizing the makespan in a multiprocessor flowshop is strongly NP-Hard, European Journal of Operational Research (to appear)"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB3","unstructured":"A. Vignier, J.-C. Billaut, C. Proust, Les probl\u00e8mes d'ordonnancement de type flow-shop hybride: \u00e9tat de l'art, in: Journ\u00e9es d'\u00e9tudes: \u201cAffectation et Ordonnancement\u201d, CNRS\/GdR Automatique\/P\u00f4le SED\/GT3, pp. 7\u201347, Tours, September 1995 CNRS\/GdR Automatique\/p\u00f4le SED\/GT3. To appear in RAIRO-RO\/Op. Res."},{"key":"10.1016\/S0377-2217(97)00333-0_BIB4","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(97)00333-0_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-2217(92)90310-6","article-title":"A multi-stage parallel processor flowshop problem with minimum flowtime","volume":"57","author":"Rajendran","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0925-5273(92)90006-S","article-title":"Scheduling in n-jobs, m stage flowshop with parallel processors to minimize makespan","volume":"27","author":"Rajendran","year":"1992","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB7","unstructured":"Ph. Fortemps, Ch. Ost, M. Pirlot, J. Teghem, D. Tuyttens, A production scheduling case study in a chemical firm using metaheuristics, European Journal of Operations Research (1996) (submitted)"},{"issue":"2","key":"10.1016\/S0377-2217(97)00333-0_BIB8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/opre.27.2.290","article-title":"A production scheduling problem in the glass-container industry","volume":"27","author":"Paul","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB9","unstructured":"E.H. Aghezzaf, A. Artiba, O. Moursli, C. Tahon, Hybrid flowshop problems, a decomposition based heuristic approach, in: Proceedings of International Conference on Industrial Engineering and Production Management (IEPM'95), pp. 43\u201356, Marrakech (Maroc), 1995. FUCAM\/IFIP\/INRIA"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB10","unstructured":"S. Bagchi, S. Uckun, Y. Miyabe, K. Kawamura, Exploring problem-specific recombination operators for job shop scheduling, in: Morgan Kaufmann (Ed.), Proceedings of the Fourth Internationnal Conference on Genetic Algorithms, pp. 10\u201317, San Mateo, California, 1991"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB11","unstructured":"M.-C. Portmann, F. Ghedjati, M\u00e9thodes approch\u00e9es pour le probl\u00e8me d'ordonnancement avec machines non identiques en parall\u00e8les et contraintes de pr\u00e9c\u00e9dence, in: Actes de AGI'94, Poitiers (France), June 1994"},{"issue":"5","key":"10.1016\/S0377-2217(97)00333-0_BIB12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/64.236477","article-title":"Managing genetic search in job shop scheduling","volume":"8","author":"Uckun","year":"1993","journal-title":"IEEE Expert"},{"key":"10.1016\/S0377-2217(97)00333-0_BIB13","unstructured":"L. Davis (Ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991"},{"issue":"1\/2","key":"10.1016\/S0377-2217(97)00333-0_BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/12460125.1996.10511679","article-title":"Performance analysis of permutation cross-over genetic operators","volume":"5","author":"Djerid","year":"1996","journal-title":"Journal of Decision Systems"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:56:27Z","timestamp":1556096187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0377221797003330"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00333-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}