{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:20Z","timestamp":1771877540788,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s10951-006-8776-2","type":"journal-article","created":{"date-parts":[[2006,7,21]],"date-time":"2006-07-21T20:49:48Z","timestamp":1153514988000},"page":"499-513","source":"Crossref","is-referenced-by-count":20,"title":["Single machine batch scheduling problem with family setup times and release dates to minimize makespan"],"prefix":"10.1007","volume":"9","author":[{"given":"J. J.","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z. H.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8776_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P., Scheduling Algorithms, Springer-Verlag, Berlin 2001."},{"key":"8776_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"Bruno, J. and P. Downey, Complexity of task sequencing with deadlines, setup times and changeover costs, SIAM Journal on Computing, 7, 393\u2013404 (1978).","journal-title":"SIAM Journal on Computing"},{"key":"8776_CR3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/A:1024858623282","volume":"6","author":"T. C. E. Cheng","year":"2003","unstructured":"Cheng, T. C. E., C. T. Ng and J. J. Yuan, The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard, Journal of Scheduling, 6, 483\u2013490 (2003).","journal-title":"Journal of Scheduling"},{"key":"8776_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"key":"8776_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0167-6377(97)00028-X","volume":"21","author":"J. B. Ghosh","year":"1997","unstructured":"Ghosh, J. B. and J. N. D. Gupta, Batch scheduling to minimize maximum lateness, Operations Research Letters, 21, 77\u201380 (1997).","journal-title":"Operations Research Letters"},{"key":"8776_CR6","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C. L. Monma","year":"1988","unstructured":"Monma, C. L. and C. N. Potts, On the complexity of scheduling with batch setup times, Operations Research, 37, 798\u2013804 (1988).","journal-title":"Operations Research"},{"key":"8776_CR7","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C. N. Potts","year":"2000","unstructured":"Potts, C. N., and M. Y. Kovalyov, Scheduling with batching: a review, European Journal of Operational Research, 120, 228\u2013249 (2000).","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8776-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8776-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8776-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8776-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["8776"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8776-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}