{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:11:00Z","timestamp":1779358260848,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0305-0548(01)00040-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"1417-1439","source":"Crossref","is-referenced-by-count":79,"title":["Heuristics for hybrid flow shops with controllable processing times and assignable due dates"],"prefix":"10.1016","volume":"29","author":[{"given":"Jatinder N.D.","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karin","family":"Kr\u00fcger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Lauff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri N.","family":"Sotskov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00040-5_BIB1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/00207549308956713","article-title":"Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling","volume":"31","author":"MacCarthy","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB2","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch and bound technique to some flow-shop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB3","series-title":"Disaggregation problems in manufacturing and service organizations","first-page":"p363","article-title":"A review of flowshop scheduling research","author":"Gupta","year":"1979"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB4","series-title":"Heuristic scheduling systems","author":"Morton","year":"1993"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB5","series-title":"Handbook of combinatorial optimization","first-page":"p21","article-title":"A review of machine scheduling: complexity, algorithms and applications","author":"Chen","year":"1998"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB6","doi-asserted-by":"crossref","unstructured":"T'Kindt V, Billaut J-C. Multicriteria scheduling problems: a survey. RAIRO Recherche Operationnelle 2001, to appear.","DOI":"10.1051\/ro:2001109"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","article-title":"Branch and bound algorithm for a flowshop with multiple processors","volume":"51","author":"Brah","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0305-0548(01)00040-5_BIB8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1111\/j.1937-5956.1996.tb00407.x","article-title":"A framework for machine scheduling problems with controllable processing times","volume":"5","author":"Alidaee","year":"1996","journal-title":"Journal of Production and Operations Management"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB9","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1080\/00207548808947920","article-title":"General flow-shop scheduling with resource constraints","volume":"26","author":"Janiak","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1018924517216","article-title":"Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations","volume":"83","author":"Janiak","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due date decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1051\/ro:1999110","article-title":"On the application of insertion techniques for job shop problems with setup times","volume":"33","author":"Sotskov","year":"1999","journal-title":"RAIRO Recherche Operationnelle"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB13","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1080\/00207728508926713","article-title":"Analytical determination of optimal TWK due dates in a job shop","volume":"16","author":"Cheng","year":"1985","journal-title":"International Journal of System Sciences"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00040-5_BIB15","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\/S0305-0548(01)00040-5_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:52:31Z","timestamp":1556725951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":16,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0305054801000405"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00040-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}