{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:58:13Z","timestamp":1770497893168,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0166-218x(01)00316-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"211-233","source":"Crossref","is-referenced-by-count":43,"title":["Single machine scheduling with assignable due dates"],"prefix":"10.1016","volume":"122","author":[{"given":"Xiangtong","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan F.","family":"Bard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00316-X_BIB1","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":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","article-title":"Scheduling and common due date assignment with earliness\u2013tardiness penalties and batch delivery costs","volume":"93","author":"Chen","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","article-title":"Single machine scheduling with batch deliveries","volume":"94","author":"Cheng","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due-date determination decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(96)80468-9","article-title":"Batch scheduling and common due-date assignment on a single machine","volume":"70","author":"Cheng","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0377-2217(98)00111-8","article-title":"Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness","volume":"114","author":"Cheng","year":"1999","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00316-X_BIB8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0020-0190(98)00153-7","article-title":"Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs","volume":"68","author":"Gordon","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(98)00055-0","article-title":"Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment","volume":"26","author":"Gordon","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB10","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1080\/07408178608975351","article-title":"Scheduling problems with generalized due dates","volume":"18","author":"Hall","year":"1986","journal-title":"IIE Trans."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB11","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness\u2013tardiness scheduling problems, II: deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/opre.49.1.134.11192","article-title":"Scheduling with fixed delivery dates","volume":"49","author":"Hall","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","article-title":"On the complexity of generalized due date scheduling problems","volume":"51","author":"Hall","year":"1991","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB14","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","article-title":"On scheduling to minimize earliness\u2013tardiness and batch delivery costs with a common due date","volume":"70","author":"Herrmann","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02192303","article-title":"Processing-plus-wait due-dates in single machine scheduling","volume":"85","author":"Kahlbacher","year":"1995","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(97)00092-9","article-title":"Batch scheduling and common due date assignment problem: an NP-hard case","volume":"80","author":"Kovalyov","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB17","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n-job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB18","series-title":"Scheduling: Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0166-218X(01)00316-X_BIB19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O","article-title":"A note on the generalized due dates scheduling problems","volume":"37","author":"Sriskandarajah","year":"1990","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB20","first-page":"557","article-title":"Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates","volume":"80","author":"Tanaka","year":"1997","journal-title":"IEICE Trans. Fund."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1023\/A:1018987625819","article-title":"Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine","volume":"86","author":"Tanaka","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB22","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1080\/07408170008967431","article-title":"Scheduling with generalized batch delivery dates and earliness penalties","volume":"32","author":"Yang","year":"2000","journal-title":"IIE Trans."},{"key":"10.1016\/S0166-218X(01)00316-X_BIB23","series-title":"Industrial Applications of Combinatorial Optimization","first-page":"1","article-title":"Moving toward an integrated decision support system for manpower planning at Continental Airlines: optimization on pilot training assignments","author":"Yu","year":"1998"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100316X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100316X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T23:59:35Z","timestamp":1556841575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0100316X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0166218X0100316X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00316-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}