{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T19:47:29Z","timestamp":1771012049253,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90023-k","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"465-475","source":"Crossref","is-referenced-by-count":26,"title":["Scheduling to minimize weighted earliness and tardiness about a common due-date"],"prefix":"10.1016","volume":"18","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(91)90023-K_BIB1","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB2","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB3","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(91)90023-K_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1057\/jors.1989.9","article-title":"On the assignment of optimal due dates","volume":"40","author":"Baker","year":"1989","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(91)90023-K_BIB5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/00207548808947888","article-title":"Determination of an optimal due date and optimal sequence in a single machine job shop","volume":"26","author":"Bector","year":"1988","journal-title":"Int. J. Prodn Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB7","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/0305-0548(87)90048-7","article-title":"An algorithm for the CON due-date determination and sequencing problem","volume":"14","author":"Cheng","year":"1987","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB9","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(91)90023-K_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0305-0548(90)90046-A","article-title":"Scheduling about a common due date with earliness and tardiness penalties","volume":"17","author":"De","year":"1990","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(90)90011-U","article-title":"CON due-date determination and sequencing","volume":"17","author":"De","year":"1990","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB12","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2","article-title":"Scheduling to a common due date on parallel uniform processors","volume":"34","author":"Emmons","year":"1987","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB13","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB14","article-title":"Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date","author":"Hall","year":"1991","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB15","article-title":"Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date","author":"Hall","year":"1991","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB16","series-title":"Inequalities","author":"Hardy","year":"1934"},{"key":"10.1016\/0305-0548(91)90023-K_BIB17","article-title":"Scheduling around a small common due date","author":"Hoogeveen","year":"1989"},{"key":"10.1016\/0305-0548(91)90023-K_BIB18","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0305-0548(91)90023-K_BIB19","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequenching problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90023-K_BIB21","series-title":"Combinatorial Optimization","first-page":"237","article-title":"The 0\u20131 knapsack problem","author":"Martello","year":"1979"},{"key":"10.1016\/0305-0548(91)90023-K_BIB22","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":"Ops Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB23","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0305-0548(91)90023-K_BIB24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1057\/jors.1987.58","article-title":"A generalized model of optimal due-date assignment by linear programming","volume":"38","author":"Quaddus","year":"1987","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(91)90023-K_BIB25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0377-2217(86)90306-1","article-title":"A V-shape property of optimal schedule of jobs about a common due date","volume":"23","author":"Raghavachari","year":"1986","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(91)90023-K_BIB26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute latneess in single-machine and multimachine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90023-K_BIB27","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":"Szware","year":"1989","journal-title":"Nav. Res. Logist. Q."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190023K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190023K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:21:37Z","timestamp":1552929697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489190023K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["030505489190023K"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90023-k","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}