{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:18Z","timestamp":1771877538399,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"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":[[1996,10]]},"DOI":"10.1016\/0166-218x(96)80468-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"231-245","source":"Crossref","is-referenced-by-count":23,"title":["Batch scheduling and common due-date assignment on a single machine"],"prefix":"10.1016","volume":"70","author":[{"given":"T.C.Edwin","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(96)80468-9_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","article-title":"The complexity of one-machine batching problems","volume":"47","author":"Albers","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(96)80468-9_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","article-title":"Complexity of task sequencing with deadlines, set-up times and changeover costs","volume":"7","author":"Bruno","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(96)80468-9_BIB3","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":"Euro. J. Oper. Res."},{"key":"10.1016\/0166-218X(96)80468-9_BIB4","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.37.3.426","article-title":"Optimal scheduling of products with two subassemblies on a single machine","volume":"37","author":"Coffman","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(96)80468-9_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","article-title":"Batch sizing and job sequencing on a single machine","volume":"26","author":"Coffman","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0166-218X(96)80468-9_BIB6","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/mnsc.33.6.784","article-title":"Batching to minimize flow times on one machine","volume":"33","author":"Dobson","year":"1987","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(96)80468-9_BIB7","doi-asserted-by":"crossref","unstructured":"T. Gaizer, private communication (1990).","DOI":"10.1515\/znb-1990-0307"},{"key":"10.1016\/0166-218X(96)80468-9_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(96)80468-9_BIB9","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: a Survey","volume":"3","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(96)80468-9_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(95)91591-Z","article-title":"Improving the complexities of approximation algorithms for optimization problems","volume":"17","author":"Kovalyov","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(96)80468-9_BIB11","author":"Kovalyov","year":"1992"},{"key":"10.1016\/0166-218X(96)80468-9_BIB12","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch setup times","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(96)80468-9_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","article-title":"One-pass batching algorithms for the one machine problem","volume":"21","author":"Naddef","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(96)80468-9_BIB14","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/00207548408942488","article-title":"A framework for the study of due-date management in job shops","volume":"22","author":"Ragatz","year":"1984","journal-title":"Int. J. Prod. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96804689?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96804689?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:45Z","timestamp":1556130465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X96804689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0166218X96804689"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(96)80468-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}