{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T19:10:02Z","timestamp":1748545802791,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_45","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"542-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-preemptive Scheduling on Machines with Setup Times"],"prefix":"10.1007","author":[{"given":"Alexander","family":"M\u00e4cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"2","key":"45_CR1","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., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219\u2013239 (1999)","journal-title":"Omega"},{"issue":"1","key":"45_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling on Parallel Machines. Journal of Scheduling 1(1), 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-07557-0_21","volume-title":"Integer Programming and Combinatorial Optimization","author":"JR Correa","year":"2014","unstructured":"Correa, J.R., Marchetti-Spaccamela, A., Matuschke, J., Stougie, L., Svensson, O., Verdugo, V., Verschae, J.: Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 249\u2013260. Springer, Heidelberg (2014)"},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00453-009-9337-9","volume":"60","author":"S Divakaran","year":"2011","unstructured":"Divakaran, S., Saks, M.E.: An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times. Algorithmica 60(2), 301\u2013315 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using Dual Approximation Algorithms for Scheduling Problems. Journal of the ACM 34(1), 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and Approximate Algorithms for Scheduling Nonidentical Processors. Journal of the ACM 23(2), 317\u2013327 (1976)","journal-title":"Journal of the ACM"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"M\u00e4cker, A., Malatyali M., Meyer auf der Heide, F., Riechers, S.: Non-Preemptive Scheduling on Machines with Setup Times. CoRR (2015). 1504.07066","DOI":"10.1007\/978-3-319-21840-3_45"},{"issue":"5","key":"45_CR8","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1287\/opre.41.5.981","volume":"41","author":"CL Monma","year":"1993","unstructured":"Monma, C.L., Potts, C.N.: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Operations Research 41(5), 981\u2013993 (1993)","journal-title":"Operations Research"},{"issue":"2","key":"45_CR9","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. European Journal of Operational Research 120(2), 228\u2013249 (2000)","journal-title":"European Journal of Operational Research"},{"key":"45_CR10","unstructured":"Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 759\u2013767. ACM\/SIAM (1999)"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-44436-X_24","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"H Shachnai","year":"2000","unstructured":"Shachnai, H., Tamir, T.: Polynomial Time Approximation Schemes for Class-Constrained Packing Problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 238\u2013249. Springer, Heidelberg (2000)"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.: Scheduling Parallel Machines On-line. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), pp. 131\u2013140. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185361"},{"issue":"7","key":"45_CR13","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1016\/j.dam.2007.05.053","volume":"156","author":"EC Xavier","year":"2008","unstructured":"Xavier, E.C., Miyazawa, F.K.: A one-dimensional bin packing problem with shelf divisions. Discrete Applied Mathematics 156(7), 1083\u20131096 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"45_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1051\/ita:2008027","volume":"43","author":"EC Xavier","year":"2009","unstructured":"Xavier, E.C., Miyazawa, F.K.: A Note on Dual Approximation Algorithms for Class Constrained Bin Packing Problems. RAIRO - Theoretical Informatics and Applications 43(2), 239\u2013248 (2009)","journal-title":"RAIRO - Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T18:50:32Z","timestamp":1748544632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}