{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:16:25Z","timestamp":1770502585690,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0167-6377(92)90027-z","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"213-218","source":"Crossref","is-referenced-by-count":56,"title":["A polynomial algorithm for a one machine batching problem"],"prefix":"10.1016","volume":"11","author":[{"given":"David F","family":"Shallcross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90027-Z_BIB1","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\/0167-6377(92)90027-Z_BIB2","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\/0167-6377(92)90027-Z_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","article-title":"A polynomial algorithm for the knapsack problem in two variables","volume":"23","author":"Hirschberg","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90027-Z_BIB4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","article-title":"Two variable integer programming","volume":"27","author":"Kannan","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90027-Z_BIB5","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. Match."},{"key":"10.1016\/0167-6377(92)90027-Z_BIB6","first-page":"1132","article-title":"A formula for finding the number of integer points under a straight line and its application","volume":"20","author":"Zamanskii","year":"1984","journal-title":"\u00c8konom. i Mat. Metody"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290027Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290027Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:50:08Z","timestamp":1552888208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290027Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["016763779290027Z"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90027-z","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}