{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:49:54Z","timestamp":1743094194219,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184995"},{"type":"electronic","value":"9783030185008"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18500-8_59","type":"book-chapter","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:02:47Z","timestamp":1567090967000},"page":"475-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Kress","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maksim","family":"Barketau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"issue":"2","key":"59_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246(2), 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"59_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219\u2013239 (1999)","journal-title":"Omega"},{"issue":"3","key":"59_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"59_CR4","volume-title":"Handbook on Scheduling: From Theory to Applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007)"},{"issue":"4","key":"59_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J Bruno","year":"1978","unstructured":"Bruno, J., Downey, P.: Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput. 7(4), 393\u2013404 (1978)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"59_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1023\/A:1024858623282","volume":"6","author":"TCE Cheng","year":"2003","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J.: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. J. Sched. 6(5), 483\u2013490 (2003)","journal-title":"J. Sched."},{"key":"59_CR7","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"6","key":"59_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10951-018-0561-5","volume":"21","author":"D Kress","year":"2018","unstructured":"Kress, D., Barketau, M., Pesch, E.: Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. J. Sched. 21(6), 595\u2013606 (2018)","journal-title":"J. Sched."},{"issue":"2","key":"59_CR9","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.ejor.2005.12.027","volume":"177","author":"LF Lu","year":"2007","unstructured":"Lu, L.F., Yuan, J.J.: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. Eur. J. Oper. Res. 177(2), 1302\u20131309 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"59_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18500-8_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T22:03:56Z","timestamp":1567116236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18500-8_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184995","9783030185008"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18500-8_59","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}