{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:25:51Z","timestamp":1770499551556,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"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,3]]},"DOI":"10.1016\/s0305-0548(02)00225-3","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T14:52:27Z","timestamp":1046789547000},"page":"473-480","source":"Crossref","is-referenced-by-count":36,"title":["A note on a due-date assignment on a two-machine flow-shop"],"prefix":"10.1016","volume":"31","author":[{"given":"Motty","family":"Birman","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00225-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","article-title":"A survey of the state-of-the-art common due-date assignment and scheduling research","volume":"139","author":"Gordon","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB2","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/S0305-0548(99)00127-6","article-title":"A common due-date assignment problem on parallel identical machines","volume":"28","author":"Mosheiov","year":"2001","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB3","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.25.1.62","article-title":"Optimal single machine scheduling with earliness and tardiness penalties","volume":"25","author":"Sidney","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB4","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.26.6.1079","article-title":"Optimal single machine scheduling with earliness and tardiness penalties","volume":"26","author":"Lakshminarayan","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/(SICI)1520-6750(199704)44:3<287::AID-NAV4>3.0.CO;2-4","article-title":"Heuristics for multi-machine minmax scheduling problems with general earliness and tardiness costs","volume":"44","author":"Federgruen","year":"1996","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(98)00323-3","article-title":"On the complexity of two-machine flowshop problems with due-date related objectives","volume":"106","author":"Koulamas","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0377-2217(99)00164-2","article-title":"Minimizing tardy jobs in a flowshop with common due-date","volume":"120","author":"Della Croce","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(99)00447-6","article-title":"Scheduling in a two-machine flowshop with batch processing machine(s) for earliness\/tardiness measure under a common due-date","volume":"131","author":"Sung","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00225-3_BIB10","doi-asserted-by":"crossref","first-page":"61","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"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T06:30:18Z","timestamp":1553668218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802002253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0305054802002253"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00225-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}