{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:54:13Z","timestamp":1768568053771,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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,9]]},"DOI":"10.1016\/s0377-2217(97)00194-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"620-631","source":"Crossref","is-referenced-by-count":44,"title":["Flowshop scheduling with identical jobs and uniform parallel machines"],"prefix":"10.1016","volume":"109","author":[{"given":"Maged M.","family":"Dessouky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed I.","family":"Dessouky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil K.","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00194-X_BIB1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00194-X_BIB2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","article-title":"Scheduling identical jobs on uniform parallel machines","volume":"44","author":"Dessouky","year":"1990","journal-title":"Statistica Neerlandica"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB3","article-title":"A note on flowshops with a large number of stages, identical jobs, and uniform parallel machines","author":"Dessouky","year":"1996"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in determining sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0377-2217(97)00194-X_BIB6","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","article-title":"Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion-time","volume":"34","author":"Guinet","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB7","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":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB8","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","article-title":"Scheduling a 2-stage hybrid flowship with separable setup and removal times","volume":"77","author":"Gupta","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00194-X_BIB9","article-title":"Scheduling a production line to minimize maximum lateness","author":"Jackson","year":"1955"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB10","series-title":"Deterministic and Stochastic Scheduling","first-page":"35","article-title":"Recent developments in deterministic sequencing and scheduling","author":"Lawler","year":"1982"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB11","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/07408178508975300","article-title":"A forward-backward procedure for the single machine problem to minimize maximum lateness","volume":"17","author":"Larson","year":"1985","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","article-title":"Minimizing makespan in hybrid flowshops","volume":"16","author":"Lee","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0377-2217(97)00194-X_BIB13","article-title":"Sequencing by enumerative methods","author":"Lenstra","year":"1977"},{"key":"10.1016\/S0377-2217(97)00194-X_BIB14","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","article-title":"On scheduling with ready times and due dates to minimize maximum lateness","volume":"23","author":"McMahon","year":"1975","journal-title":"Oper. Res."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700194X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700194X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:57:53Z","timestamp":1556110673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700194X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S037722179700194X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00194-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}