{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:39:00Z","timestamp":1773326340071,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0305-0548(02)00068-0","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:07:53Z","timestamp":1045505273000},"page":"1219-1231","source":"Crossref","is-referenced-by-count":134,"title":["New heuristics for no-wait flowshops to minimize makespan"],"prefix":"10.1016","volume":"30","author":[{"given":"Tariq","family":"Aldowaisan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Allahverdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00068-0_BIB1","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\/S0305-0548(02)00068-0_BIB2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/nav.3800290311","article-title":"Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times","volume":"29","author":"Adiri","year":"1982","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB3","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L","article-title":"Heuristic algorithms for continuous flow-shop problem","volume":"37","author":"Rajendran","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB4","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1038\/sj\/jors\/0421105","article-title":"Solvable cases of the no-wait flowshop scheduling problem","volume":"42","author":"Van der Veen","year":"1991","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB5","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\/S0305-0548(02)00068-0_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1057\/palgrave.jors.2601110","article-title":"Minimizing total completion time in a no-wait flowshop with sequence dependent additive changeover times","volume":"52","author":"Allahverdi","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1111\/j.1475-3995.2000.tb00197.x","article-title":"No-wait and separate setup three-machine flowshop with total completion time criterion","volume":"7","author":"Allahverdi","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB8","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","article-title":"Total flowtime in no-wait flowshops with separated setup times","volume":"25","author":"Aldowaisan","year":"1998","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB9","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","article-title":"A new heuristic and dominance relations for no-wait flowshops with setups","volume":"28","author":"Aldowaisan","year":"2001","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","article-title":"On the flowshop sequencing problems with no wait in process","volume":"23","author":"Reddi","year":"1972","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB11","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\/S0305-0548(02)00068-0_BIB12","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\/S0305-0548(02)00068-0_BIB13","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\/S0305-0548(02)00068-0_BIB14","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\/S0305-0548(02)00068-0_BIB15","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 the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00068-0_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 flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA The International Journal of Management Sciences"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB17","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\/S0305-0548(02)00068-0_BIB18","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of flowshop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB19","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB20","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","article-title":"Genetic algorithms for flowshop scheduling problems","volume":"30","author":"Murata","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(02)00068-0_BIB21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:26:11Z","timestamp":1555176371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0305054802000680"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00068-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}