{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T15:30:12Z","timestamp":1784129412779,"version":"3.55.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T00:00:00Z","timestamp":1521417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Belorussian Fund of Fundamental Research","award":["see Manuscript (special characters)"],"award-info":[{"award-number":["see Manuscript (special characters)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10951-018-0561-5","type":"journal-article","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T06:47:03Z","timestamp":1521442023000},"page":"595-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines"],"prefix":"10.1007","volume":"21","author":[{"given":"Dominik","family":"Kress","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maksim","family":"Barketau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,19]]},"reference":[{"issue":"2","key":"561_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. (2015). The third comprehensive survey on scheduling problems with setup times\/costs. European Journal of Operational Research, 246(2), 345\u2013378.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"561_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. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219\u2013239.","journal-title":"Omega"},{"issue":"3","key":"561_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. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"561_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470451793","volume-title":"Principles of sequencing and scheduling","author":"KR Baker","year":"2009","unstructured":"Baker, K. R., & Trietsch, D. (2009). Principles of sequencing and scheduling. Hoboken, New Jersey: Wiley."},{"key":"561_CR5","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., & W\u0119glarz, J. (2007). Handbook on scheduling: From theory to applications. Berlin: Springer."},{"issue":"4","key":"561_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J Bruno","year":"1978","unstructured":"Bruno, J., & Downey, P. (1978). Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM Journal on Computing, 7(4), 393\u2013404.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"561_CR7","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. (2003). The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. Journal of Scheduling, 6(5), 483\u2013490.","journal-title":"Journal of Scheduling"},{"key":"561_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"561_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1018959420252","volume":"92","author":"AE Gerodimos","year":"1999","unstructured":"Gerodimos, A. E., Glass, C. A., Potts, C. N., & Tautenhahn, T. (1999). Scheduling multi-operation jobs on a single machine. Annals of Operations Research, 92, 87\u2013105.","journal-title":"Annals of Operations Research"},{"key":"561_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"561_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.7.4.443","volume":"7","author":"JW Herrmann","year":"1995","unstructured":"Herrmann, J. W., & Lee, C. Y. (1995). Solving a class scheduling problem with a genetic algorithm. ORSA Journal on Computing, 7(4), 443\u2013452.","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"561_CR12","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. (2007). The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. European Journal of Operational Research, 177(2), 1302\u20131309.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"561_CR13","first-page":"165","volume":"30","author":"SV Mehta","year":"1998","unstructured":"Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30(2), 165\u2013178.","journal-title":"IIE Transactions"},{"issue":"5","key":"561_CR14","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798\u2013804.","journal-title":"Operations Research"},{"issue":"2","key":"561_CR15","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. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120(2), 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"561_CR16","volume-title":"Scheduling theory. Single-stage systems","author":"VS Tanaev","year":"1994","unstructured":"Tanaev, V. S., Gordon, V. S., & Shafransky, Y. (1994). Scheduling theory. Single-stage systems. Dordrecht: Springer."},{"key":"561_CR17","volume-title":"Scheduling theory. Group technologies","author":"VS Tanaev","year":"1998","unstructured":"Tanaev, V. S., Kovalyov, M. Y., & Shafransky, Y. M. (1998). Scheduling theory. Group technologies. Minsk: Institute of Engineering Cybernetics, National Academy of Sciences of Belarus. (in Russian)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0561-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0561-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0561-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T20:27:36Z","timestamp":1552940856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0561-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,19]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0561-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,19]]},"assertion":[{"value":"19 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}