{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:52:11Z","timestamp":1769025131875,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00090-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"869-885","source":"Crossref","is-referenced-by-count":47,"title":["Minimizing tardiness in a two-machine flow-shop"],"prefix":"10.1016","volume":"29","author":[{"given":"Jason Chao-Hsien","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jen-Shiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chii-Ming","family":"Chao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00090-3_BIB1","series-title":"Introduction to sequencing and scheduling","author":"Baker","year":"1977"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB3","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One-machine scheduling to minimize certain function of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB4","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimizing total costs in one-machine scheduling","volume":"23","author":"Rinnooy Kan","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.26.1.111","article-title":"Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks","volume":"26","author":"Baker","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","article-title":"A decomposition algorithm for the single machine total tardiness problem","volume":"1","author":"Potts","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB10","series-title":"Theory of scheduling. Reading","author":"Conway","year":"1967"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB11","series-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"French","year":"1982"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<721::AID-NAV8>3.0.CO;2-7","article-title":"A total tardiness problem with preprocessing included","volume":"43","author":"Koulamas","year":"1996","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB13","first-page":"133","article-title":"On two-machine scheduling with release and due dates to minimize maximum lateness","volume":"17","author":"Grabowski","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(89)90005-1","article-title":"The two-machine flowshop scheduling problem with total tardiness","volume":"16","author":"Sen","year":"1989","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","article-title":"A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops","volume":"20","author":"Kim","year":"1993","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1080\/00207729708929401","article-title":"Two-machine flow-shop scheduling to minimize total tardiness","volume":"28","author":"Pan","year":"1997","journal-title":"International Journal of Systems Science"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB17","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1057\/jors.1983.142","article-title":"On flow shop scheduling with release and due dates to minimize maximum lateness","volume":"34","author":"Grabowski","year":"1983","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB18","first-page":"391","article-title":"Minimizing total tardiness in permutation flowshops","volume":"20","author":"Kim","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(00)00090-3_BIB20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Mathematical Programming"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000903?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000903?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:51Z","timestamp":1556508471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000903"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00090-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}