{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:01:04Z","timestamp":1778587264297,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","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 & Operations Research"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90011-u","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"333-342","source":"Crossref","is-referenced-by-count":12,"title":["CON due-date determination and sequencing"],"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)90011-U_BIB1","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 Opns Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB2","article-title":"Sequencing with earliness and tardiness penalties: a review","author":"Baker","year":"1988"},{"key":"10.1016\/0305-0548(90)90011-U_BIB3","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)90011-U_BIB4","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."},{"key":"10.1016\/0305-0548(90)90011-U_BIB5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","article-title":"Optimal common due-date with limited completion time deviation","volume":"15","author":"Cheng","year":"1988","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB6","article-title":"On the assignment of optimal due dates","author":"Baker","year":"1988"},{"key":"10.1016\/0305-0548(90)90011-U_BIB7","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. Product. Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/00207548108956667","article-title":"Optimal assignment of due-dates for a single processor scheduling problem","volume":"19","author":"Seidmann","year":"1981","journal-title":"Int. J. Product. Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB9","article-title":"Weighted deviation of completion times about a common due date","author":"Hall","year":"1989"},{"key":"10.1016\/0305-0548(90)90011-U_BIB10","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(90)90011-U_BIB11","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(90)90011-U_BIB12","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(90)90011-U_BIB13","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","article-title":"An implicit enumeration algorithm for quadratic integer programming","volume":"26","author":"McBride","year":"1980","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90011-U_BIB14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","article-title":"The indefinite zero-one quadratic problem","volume":"7","author":"Carter","year":"1984","journal-title":"Discrete Appl. Mathemat."},{"key":"10.1016\/0305-0548(90)90011-U_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","article-title":"Unconstrained quadratic bivalent programming problem","volume":"15","author":"Gulati","year":"1984","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB16","article-title":"Computational aspects of a branch and bound algorithm for quadratic zero-one programming","author":"Rodgers","year":"1988"},{"key":"10.1016\/0305-0548(90)90011-U_BIB17","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":"Opns Res."},{"key":"10.1016\/0305-0548(90)90011-U_BIB18","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 sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90011-U_BIB19","series-title":"Inequalities","author":"Hardy","year":"1934"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090011U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090011U?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:20:23Z","timestamp":1552929623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489090011U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["030505489090011U"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90011-u","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}