{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:21Z","timestamp":1771877541243,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"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":[[2005,4]]},"DOI":"10.1007\/s10951-005-6365-4","type":"journal-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T10:44:49Z","timestamp":1112784289000},"page":"161-177","source":"Crossref","is-referenced-by-count":11,"title":["Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs"],"prefix":"10.1007","volume":"8","author":[{"given":"H. A. J.","family":"Crauwels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Van","family":"Oudheusden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. N.","family":"Van Wassenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"CR1","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, set-up times and changeover costs? SIAM J. Computing, 7(4), 393?404 (1978).","journal-title":"SIAM J. Computing"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(95)00349-5","volume":"90","author":"H. A. J. Crauwels","year":"1996","unstructured":"Crauwels, H. A. J., C. N. Potts, and L. N. Van Wassenhove, ?Local search heuristics for single machine scheduling with batching to minimize the number of late jobs? European Journal of Operational Research, 90, 200?213 (1996).","journal-title":"European Journal of Operational Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<51::AID-JOS34>3.0.CO;2-K","volume":"3","author":"S. Dunstall","year":"2000","unstructured":"Dunstall, S., A. Wirth, and K. R. Baker, ?Lower bounds and algorithms for flowtime minimization on a single machine with set-up times? Journal of Scheduling, 3, 51?69 (2000).","journal-title":"Journal of Scheduling"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018903027868","volume":"70","author":"A. M. A. Hariri","year":"1997","unstructured":"Hariri, A. M. A. and C. N. Potts, ?Single machine scheduling with batch set-up times to minimize maximum lateness? Annals of Operations Research, 70, 75?92 (1997).","journal-title":"Annals of Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C. L. Monma","year":"1989","unstructured":"Monma, C. L. and C. N. Potts, ?On the complexity of scheduling with batch setup times? Operations Research, 37, 798?804 (1989).","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M., ?An n job, one machine sequencing algorithm for minimizing the number of late jobs? Management Science, 15, 102?109 (1968).","journal-title":"Management Science"},{"key":"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?249 (2000).","journal-title":"European Journal of Operational Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C. N. Potts","year":"1992","unstructured":"Potts, C. N. and Van L. N. Wassenhove, ?Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity? Journal of the Operational Research Society, 43, 395?406 (1992).","journal-title":"Journal of the Operational Research Society"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S. Webster","year":"1995","unstructured":"Webster, S. and K. R. Baker, ?Scheduling groups of jobs on a single machine? Operations Research, 43, 692?703 (1995).","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6365-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-6365-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6365-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:37Z","timestamp":1559453977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-6365-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["6365"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-6365-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}