{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:01:07Z","timestamp":1778587267697,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90046-a","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"231-241","source":"Crossref","is-referenced-by-count":25,"title":["Scheduling about a common due date with earliness and tardiness penalties"],"prefix":"10.1016","volume":"17","author":[{"given":"Prabuddha","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay B.","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles E.","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90046-A_BIB1","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":"Opns Res."},{"key":"10.1016\/0305-0548(90)90046-A_BIB2","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":"Opns Res."},{"key":"10.1016\/0305-0548(90)90046-A_BIB3","article-title":"Sequencing with Earliness and Tardiness Penalties: A Review","author":"Baker","year":"1988"},{"key":"10.1016\/0305-0548(90)90046-A_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-188X(83)90012-5","article-title":"Minimizing a quadratic function of job lateness on a single machine","volume":"7","author":"Gupta","year":"1983","journal-title":"Engng Costs Product. Econ."},{"key":"10.1016\/0305-0548(90)90046-A_BIB5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","article-title":"Minimizing weighted absolute deviation in single machine scheduling","volume":"19","author":"Fry","year":"1987","journal-title":"IIE Trans."},{"key":"10.1016\/0305-0548(90)90046-A_BIB6","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","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90046-A_BIB7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multimachine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90046-A_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single- and multiple-processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90046-A_BIB9","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 data","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90046-A_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignment to minimize total penalty for the one machine scheduling problem","volume":"30","author":"Panwalker","year":"1982","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90046-A_BIB11","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3","article-title":"Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date","volume":"34","author":"Bagchi","year":"1987","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90046-A_BIB12","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90046-A_BIB13","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimization in single machine sequencing problems","volume":"18","author":"Merten","year":"1972","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90046-A_BIB14","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","article-title":"Minimizing the time-in-system variance for a finite jobset","volume":"21","author":"Schrage","year":"1975","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90046-A_BIB15","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","article-title":"Minimizing waiting time variance in the single machine problem","volume":"23","author":"Eilon","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90046-A_BIB16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.35.1.111","article-title":"Deterministic and random single machine sequencing with variance minimization","volume":"35","author":"Vani","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90046-A_BIB17","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.35.9.1143","article-title":"A note on the minimization of mean squared deviation of completion times about a common due date","volume":"35","author":"De","year":"1989","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90046-A_BIB18","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":"Kan","year":"1975","journal-title":"Opns Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090046A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090046A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:59:37Z","timestamp":1552913977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489090046A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["030505489090046A"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90046-a","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}