{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:19Z","timestamp":1771877539254,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1016\/s0167-6377(01)00105-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"66-68","source":"Crossref","is-referenced-by-count":12,"title":["A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints"],"prefix":"10.1016","volume":"30","author":[{"given":"C.T","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.E","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.J","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00105-5_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\/S0167-6377(01)00105-5_BIB2","unstructured":"P. Brucker, S. Knust, Complexity results for scheduling problems, http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/, 2001."},{"key":"10.1016\/S0167-6377(01)00105-5_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","article-title":"Batch sizing and sequencing on a single machine","volume":"26","author":"Coffman","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00105-5_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(01)00105-5_BIB5","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on a single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T19:29:31Z","timestamp":1556911771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701001055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167637701001055"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00105-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}