{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:33:23Z","timestamp":1743078803441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_3","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"19-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Maintenance Jobs in Networks"],"prefix":"10.1007","author":[{"given":"Fidaa","family":"Abed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Disser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gro\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Megow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie","family":"Mei\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander T.","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Rischke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.endm.2013.05.092","volume":"41","author":"A Bley","year":"2013","unstructured":"Bley, A., Karch, D., D\u2019Andreagiovanni, F.: WDM fiber replacement scheduling. Electron. Notes Discret. Math. 41, 189\u2013196 (2013). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065313000954","journal-title":"Electron. Notes Discret. Math."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10878-015-9910-x","volume":"32","author":"N Boland","year":"2016","unstructured":"Boland, N., Kalinowski, T., Kaur, S.: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32(3), 885\u2013905 (2016)","journal-title":"J. Comb. Optim."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2015.05.011","volume":"64","author":"N Boland","year":"2015","unstructured":"Boland, N., Kalinowski, T., Kaur, S.: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64, 113\u2013129 (2015). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054815001288","journal-title":"Comput. Oper. Res."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2012.05.027","volume":"163","author":"N Boland","year":"2014","unstructured":"Boland, N., Kalinowski, T., Waterer, H., Zheng, L.: Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163, 34\u201352 (2014). http:\/\/dx.doi.org\/10.1016\/j.dam.2012.05.027","journal-title":"Discret. Appl. Math."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-0-85729-778-5_10","volume-title":"Supply Chain Disruptions: Theory and Practice of Managing Risk","author":"NL Boland","year":"2012","unstructured":"Boland, N.L., Savelsbergh, M.W.P.: Optimizing the hunter valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions: Theory and Practice of Managing Risk, pp. 275\u2013302. Springer, London (2012). doi:10.1007\/978-0-85729-778-5_10"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R Canetti","year":"1998","unstructured":"Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993\u20131015 (1998). http:\/\/dx.doi.org\/10.1137\/S0097539795283292","journal-title":"SIAM J. Comput."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chang, J., Khuller, S., Mukherjee, K.: LP rounding and combinatorial algorithms for minimizing active and busy time. In: Blelloch, G.E., Sanders, P. (eds.) Proceedings of the 26th SPAA, pp. 118\u2013127. ACM, New York (2014). http:\/\/doi.acm.org\/10.1145\/2612669.2612689","DOI":"10.1145\/2612669.2612689"},{"key":"3_CR8","unstructured":"Chang, J., Khuller, S., Mukherjee, K.: Active and busy time minimization. In: Proceedings of the 12th MAPSP, pp. 247\u2013249 (2015). http:\/\/feb.kuleuven.be\/mapsp.2015\/Proceedings%20MAPSP%202015.pdf"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-18263-6_10","volume-title":"Approximation and Online Algorithms","author":"V Cohen-Addad","year":"2015","unstructured":"Cohen-Addad, V., Li, Z., Mathieu, C., Milis, I.: Energy-efficient algorithms for non-preemptive speed-scaling. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 107\u2013118. Springer, Cham (2015). doi:10.1007\/978-3-319-18263-6_10"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1287\/moor.1110.0520","volume":"37","author":"JR Correa","year":"2012","unstructured":"Correa, J.R., Skutella, M., Verschae, J.: The power of preemption on unrelated machines and applications to scheduling orders. Math. Oper. Res. 37(2), 379\u2013398 (2012). http:\/\/dx.doi.org\/10.1287\/moor.1110.0520","journal-title":"Math. Oper. Res."},{"issue":"40\u201342","key":"3_CR11","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M Flammini","year":"2010","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40\u201342), 3553\u20133562 (2010). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397510002926","journal-title":"Theor. Comput. Sci."},{"key":"3_CR12","unstructured":"Ha, S.: Compile-time scheduling of dataflow program graphs with dynamic constructs. Ph.D. thesis, University of California, Berkeley (1992). http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/1992\/ERL-92-43.pdf"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ejor.2014.10.003","volume":"242","author":"T Kalinowski","year":"2015","unstructured":"Kalinowski, T., Matsypura, D., Savelsbergh, M.W.: Incremental network design with maximum flows. Eur. J. Oper. Res. 242(1), 51\u201362 (2015). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221714008078","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10951-014-0411-z","volume":"18","author":"R Khandekar","year":"2015","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Real-time scheduling to minimize machine busy times. J. Sched. 18(6), 561\u2013573 (2015). http:\/\/dx.doi.org\/10.1007\/s10951-014-0411-z","journal-title":"J. Sched."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Shalom, M., Voloshin, A., Wong, P.W.H., Zaks, S.: Optimizing busy time on parallel machines. In: Proceedings of the 26th IPDPS, pp. 238\u2013248. IEEE (2012). http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=6267839","DOI":"10.1109\/IPDPS.2012.31"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ejor.2012.07.010","volume":"223","author":"SG Nurre","year":"2012","unstructured":"Nurre, S.G., Cavdaroglu, B., Mitchell, J.E., Sharkey, T.C., Wallace, W.A.: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem. Eur. J. Oper. Res. 223(3), 794\u2013806 (2012). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221712005310","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-60153-8_26","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"EW Parsons","year":"1995","unstructured":"Parsons, E.W., Sevcik, K.C.: Multiprocessor scheduling for high-variability service time distributions. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1995. LNCS, vol. 949, pp. 127\u2013145. Springer, Heidelberg (1995). doi:10.1007\/3-540-60153-8_26"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"AS Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM J. Discret. Math. 15(4), 450\u2013469 (2002). http:\/\/dx.doi.org\/10.1137\/S0895480199357078","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR19","unstructured":"Soper, A.J., Strusevich, V.A.: Power of preemption on uniform parallel machines. In: Proceedings of the 17th APPROX. LIPIcs, vol. 28, pp. 392\u2013402. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2014). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2014\/4711"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:21:41Z","timestamp":1710346901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}