{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:18Z","timestamp":1759666158424},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"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":[[2004,2]]},"DOI":"10.1016\/s0305-0548(02)00143-0","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T13:11:25Z","timestamp":1043932285000},"page":"157-180","source":"Crossref","is-referenced-by-count":41,"title":["A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness"],"prefix":"10.1016","volume":"31","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00143-0_BIB1","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)00143-0_BIB2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0377-2217(94)00059-L","article-title":"Heuristic procedures for minimizing makespan and the number of required pallets","volume":"86","author":"Chu","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0377-2217(94)00021-4","article-title":"Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge","volume":"85","author":"Zegordi","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","article-title":"A hybrid three-stage flowshop problem","volume":"109","author":"Riane","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB5","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1287\/mnsc.23.9.1016","article-title":"Sequencing n jobs on m machines to minimize maximum tardiness","volume":"23","author":"Townsend","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1057\/jors.1993.3","article-title":"Heuristics for flowshop scheduling problems minimizing mean tardiness","volume":"44","author":"Kim","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00143-0_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\/S0305-0548(02)00143-0_BIB8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/S0360-8352(97)00139-3","article-title":"Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell","volume":"34","author":"Srinivasaraghavan","year":"1998","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","article-title":"Tabu search for total tardiness minimization in flowshop scheduling problems","volume":"26","author":"Armentano","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","article-title":"Multiple and bicriteria scheduling","volume":"81","author":"Nagar","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB11","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\/S0305-0548(02)00143-0_BIB12","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)00143-0_BIB13","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\/S0305-0548(02)00143-0_BIB14","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\/S0305-0548(02)00143-0_BIB15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"OMEGA The International Journal of Management Sciences"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/05695557908974469","article-title":"Optimal two-stage production scheduling with setup times separated","volume":"11","author":"Yoshida","year":"1979","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB17","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1057\/jors.1995.122","article-title":"Two-stage production scheduling with separated setup times and stochastic breakdowns","volume":"46","author":"Allahverdi","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00143-0_BIB18","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0305-0548(91)90060-5","article-title":"Job lateness in a two-machine flowshop with setup times separated","volume":"18","author":"Dileepan","year":"1991","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:S0305054802001430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:57:54Z","timestamp":1553932674000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0305054802001430"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00143-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}