{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:56:48Z","timestamp":1769025408062,"version":"3.49.0"},"reference-count":12,"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)00194-6","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"317-345","source":"Crossref","is-referenced-by-count":27,"title":["On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties"],"prefix":"10.1016","volume":"31","author":[{"given":"Volker","family":"Lauff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00194-6_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","article-title":"Minimizing the average deviation of job completion times about a common due date","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB2","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, i","volume":"5","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0307-904X(94)00022-X","article-title":"Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem","volume":"19","author":"Sarper","year":"1995","journal-title":"Applied Mathematical Modelling"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB5","unstructured":"Gupta JND, Lauff V, Werner F. A branch and bound algorithm for two-machine flow shop problems with earliness and tardiness penalties. Otto-von-Guericke-Universit\u00e4t, FMA, Preprint 33\/99, 1999."},{"key":"10.1016\/S0305-0548(02)00194-6_BIB6","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1002\/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-X","article-title":"Single machine scheduling to minimize absolute deviation of completion times from a common due date","volume":"36","author":"Szwarc","year":"1989","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800330206","article-title":"Minimizing mean absolute deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties","volume":"38","author":"Baker","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-6377(96)00054-5","article-title":"The complexity of scheduling job families about a common due date","volume":"20","author":"Webster","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"10.1016\/S0305-0548(02)00194-6_BIB11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0167-6377(90)90056-B","article-title":"Equivalence of mean flow time problems and mean absolute deviation problems","volume":"9","author":"Kubiak","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00194-6_BIB12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/nav.3800230206","article-title":"Optimal flowshop schedules with no intermediate storage space","volume":"23","author":"Gupta","year":"1976","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:S0305054802001946?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001946?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:56:52Z","timestamp":1553914612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0305054802001946"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00194-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}