{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:33:44Z","timestamp":1772793224133,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":[[2003,6]]},"DOI":"10.1016\/s0377-2217(02)00253-9","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:07:53Z","timestamp":1045505273000},"page":"373-396","source":"Crossref","is-referenced-by-count":29,"title":["The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime"],"prefix":"10.1016","volume":"147","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00253-9_BIB1","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\/S0377-2217(02)00253-9_BIB2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/S0360-8352(99)00149-7","article-title":"Two-machine flowshop scheduling with bicriteria problem","volume":"36","author":"Chou","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","article-title":"The two-machine total completion time flow shop problem","volume":"90","author":"Della Croce","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","article-title":"Flow shop and job shop schedules","volume":"26","author":"Gonzalez","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/095372899233217","article-title":"Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","article-title":"A new heuristic for the n-job, m-machine flow-shop problem","volume":"52","author":"Ho","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB8","first-page":"128","article-title":"A two-machine flowshop scheduling heuristic with bicriteria objective","volume":"5","author":"Lee","year":"1998","journal-title":"International Journal of Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00253-9_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)00253-9_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":"63","author":"Nagar","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00253-9_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)00253-9_BIB12","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","article-title":"Genetic algorithms for the two-stage bicriteria flowshop problem","volume":"95","author":"Neppalli","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB13","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two-stage flowshop scheduling problem with bicriteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB14","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1080\/00207549408957083","article-title":"A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria","volume":"32","author":"Rajendran","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB15","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/0377-2217(93)E0212-G","article-title":"Heuristics for scheduling in flowshop with multiple objectives","volume":"82","author":"Rajendran","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","article-title":"An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs","volume":"103","author":"Rajendran","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0377-2217(98)00009-5","article-title":"A bicriteria approach to the two-machine flow shop scheduling problem","volume":"113","author":"Sayin","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB18","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)00253-9_BIB19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","article-title":"Minimizing the sum of job completion times in the two-machine flow-shop by Lagrangean relaxation","volume":"26","author":"Van De Velde","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB20","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/0377-2217(95)00347-9","article-title":"Heuristic approaches for n\/m\/F\/\u2211Ci scheduling problem","volume":"96","author":"Wang","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0305-0548(97)00050-6","article-title":"A heuristic algorithm for mean flowtime objective in flowshop scheduling","volume":"25","author":"Woo","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB22","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\/flowshop\/aF+bCmax flowshop scheduling problem","volume":"26","author":"Yeh","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00253-9_BIB23","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:S0377221702002539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:12:47Z","timestamp":1580893967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0377221702002539"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00253-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}