{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T08:28:20Z","timestamp":1748248100519,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T00:00:00Z","timestamp":1492041600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Capes","doi-asserted-by":"crossref","award":["PVE n. A007\/2013"],"award-info":[{"award-number":["PVE n. A007\/2013"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10951-017-0517-1","type":"journal-article","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T07:26:09Z","timestamp":1492068369000},"page":"493-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling cleaning activities on trains by minimizing idle times"],"prefix":"10.1007","volume":"20","author":[{"given":"Enrico","family":"Bartolini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3283-6131","authenticated-orcid":false,"given":"Mauro","family":"Dell\u2019Amico","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Iori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"issue":"5","key":"517_CR1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S. (2010). Energy-efficient algorithms. Communications of the ACM, 53(5), 86\u201396.","journal-title":"Communications of the ACM"},{"issue":"7","key":"517_CR2","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1016\/j.jcss.2015.03.001","volume":"81","author":"S Albers","year":"2015","unstructured":"Albers, S., Antoniadis, A., & Greiner, G. (2015). On multi-processor speed scaling with migration. Journal of Computer and System Sciences, 81(7), 1194\u20131209.","journal-title":"Journal of Computer and System Sciences"},{"key":"517_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin, E. M., Hassin, R., & Levin, A. (2006). Approximations for minimum and min\u2013max vehicle routing problems. Journal of Algorithms, 59, 1\u201318.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"517_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","volume":"239","author":"AJ Castillo-Salazar","year":"2014","unstructured":"Castillo-Salazar, A. J., Landa-Silva, D., & Qu, R. (2014). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39\u201367.","journal-title":"Annals of Operations Research"},{"key":"517_CR5","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: Complexity, algorithms and approximabilit. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 21\u2013169). Norwell: Klower Academic Publisher."},{"key":"517_CR6","unstructured":"Cirne, W., & Desai, N. (Eds.) (2015). Job scheduling strategies for parallel processing, volume 8828 of Lecture Notes in Computer Science. Springer International Publishing."},{"key":"517_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10107-014-0831-8","volume":"154","author":"J Correa","year":"2015","unstructured":"Correa, J., Marchetti-Spaccamela, A., Matuschke, J., Stougie, L., Svensson, O., Verdugo, V., et al. (2015). Strong lp formulations for scheduling splittable jobson unrelated machines. Mathematical Programming, B, 154, 305\u2013328.","journal-title":"Mathematical Programming, B"},{"key":"517_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"517_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers, G. (2010). Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research, 58, 179\u2013192.","journal-title":"Operations Research"},{"key":"517_CR10","doi-asserted-by":"crossref","unstructured":"Feitelson, D. G., & Rudolph, L. (1995). Parallel job scheduling: Issues and approaches. In D. G. Feitelson & L. Rudolph (Eds.), Job scheduling strategies for parallel processing, Lecture Notes in Computer Science, (pp. 1\u201318). Berlin Heidelberg: Springer.","DOI":"10.1007\/3-540-60153-8_20"},{"key":"517_CR11","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1057\/palgrave.jors.2601782","volume":"55","author":"A Lim","year":"2004","unstructured":"Lim, A., Rodrigues, B., & Song, L. (2004). Manpower allocation with time windows. Journal of the Operational Research Society, 55, 1178\u20131186.","journal-title":"Journal of the Operational Research Society"},{"key":"517_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley-Interscience."},{"key":"517_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling. Berlin: Springer-Verlag."},{"key":"517_CR14","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1057\/jors.2009.2","volume":"60","author":"CN Potts","year":"2009","unstructured":"Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: A survey of milestones. Journal of the Operational Research Society, 60, 541\u2013568.","journal-title":"Journal of the Operational Research Society"},{"key":"517_CR15","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1287\/mnsc.2014.1947","volume":"61","author":"R Roberti","year":"2015","unstructured":"Roberti, R., Bartolini, E., & Mingozzi, A. (2015). The fixed charge transportation problem: An exact algorithm based on a new integer programming formulation. Management Science, 61, 1275\u20131291.","journal-title":"Management Science"},{"key":"517_CR16","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P Serafini","year":"1996","unstructured":"Serafini, P. (1996). Scheduling jobs on severalmachines with the job splitting property. Operations Research, 44, 617\u2013628.","journal-title":"Operations Research"},{"key":"517_CR17","unstructured":"Shioura, K., Shakhlevich, N.V., & Strusevich, V.A. (2015). Energy saving computational models with speed scaling via submodular optimization. In Proceedings of Third International Conference on Green Computing, Technology and Innovation, ICGCTI2015, pp. 7\u201318, Wilmington, New Castle, DE 19801, USA. The Society of Digital Information and Wireless Communications."},{"key":"517_CR18","doi-asserted-by":"crossref","first-page":"16879","DOI":"10.15680\/IJIRSET.2014.0310067","volume":"3","author":"A Tikar","year":"2014","unstructured":"Tikar, A., Jaybhaye, S. M., & Pathak, G. R. (2014). A survey on task scheduling for parallel workloads in the cloud computing system. International Journal of Innovative Research in Science, Engineering and Technology, 3, 16879\u201316885.","journal-title":"International Journal of Innovative Research in Science, Engineering and Technology"},{"key":"517_CR19","unstructured":"Tilk, C., & Irnich, S. (2014). Dynamic programming for the minimum tour duration problem. Technical report, Chair of Logistics Management, Johannes Gutenberg University."},{"key":"517_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W Xing","year":"2000","unstructured":"Xing, W., & Zhang, J. (2000). Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103, 259\u2013269.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0517-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0517-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0517-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T15:22:41Z","timestamp":1719156161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0517-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,13]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["517"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0517-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,4,13]]}}}