{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:35:23Z","timestamp":1773326123188,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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,1]]},"DOI":"10.1016\/s0377-2217(02)00646-x","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:45:15Z","timestamp":1043941515000},"page":"132-147","source":"Crossref","is-referenced-by-count":43,"title":["No-wait flowshops with bicriteria of makespan and maximum lateness"],"prefix":"10.1016","volume":"152","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tariq","family":"Aldowaisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00646-X_BIB1","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1057\/jors.1976.176","article-title":"Solutions to the constrained flowshop sequencing problem","volume":"24","author":"Bonney","year":"1976","journal-title":"Operations Research Quarterly"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB2","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1080\/095372899232777","article-title":"A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization","volume":"10","author":"Chakravarthy","year":"1999","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB3","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","article-title":"Genetic algorithms applied to the continuous flow shop problem","volume":"30","author":"Chen","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB4","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1002\/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H","article-title":"Multiobjective flow-shop scheduling","volume":"37","author":"Daniels","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","article-title":"Heuristic algorithms for scheduling in the no-wait flowshop","volume":"32","author":"Gangadharan","year":"1993","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB6","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey of machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0377-2217(94)00029-C","article-title":"Minimizing total tardiness in permutation flowshops","volume":"85","author":"Kim","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1080\/00207548008919673","article-title":"Heuristics for flowshop scheduling","volume":"18","author":"King","year":"1980","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB9","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/jors.1995.102","article-title":"A branch-and-bound approach for a two-machine flowshop scheduling problem","volume":"46","author":"Nagar","year":"1995","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF02125405","article-title":"A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem","volume":"46","author":"Nagar","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB11","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 flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA The International Journal of Management Sciences"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB12","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","article-title":"A no-wait flowshop scheduling heuristic to minimize makespan","volume":"45","author":"Rajendran","year":"1994","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","article-title":"On the flowshop sequencing problems with no wait inprocess","volume":"23","author":"Reddi","year":"1972","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","article-title":"Some new results in flowshop scheduling","volume":"28","author":"R\u00f6ck","year":"1984","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB15","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/S0377-2217(97)00338-X","article-title":"A bicriteria two-machine permutation flowshop problem","volume":"107","author":"Sivrikaya-Serifoglu","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB16","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.20.3.689","article-title":"Solution of the flowshop sequencing problem with no intermediate queues","volume":"20","author":"Wismer","year":"1972","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB17","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/S0305-0548(98)00106-3","article-title":"A new branch-and-bound approach for the n\/2\/flowhsop\/aF+bCmax flowshop scheduling problem","volume":"26","author":"Yeh","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00646-X_BIB18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0278-6125(01)80034-0","article-title":"An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem","volume":"20","author":"Yeh","year":"2001","journal-title":"Journal of Manufacturing Systems"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200646X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200646X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T23:59:00Z","timestamp":1553903940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200646X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S037722170200646X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00646-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}