{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T09:54:08Z","timestamp":1768643648211,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T00:00:00Z","timestamp":1432857600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9910-x","type":"journal-article","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T11:10:46Z","timestamp":1432811446000},"page":"885-905","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period"],"prefix":"10.1007","volume":"32","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Kalinowski","sequence":"additional","affiliation":[]},{"given":"Simranjit","family":"Kaur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"issue":"3","key":"9910_CR1","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ejor.2014.04.018","volume":"238","author":"M Baxter","year":"2014","unstructured":"Baxter M, Elgindy T, Ernst AT, Kalinowski T, Savelsbergh MWP (2014) Incremental network design with shortest paths. Eur J Oper Res 238(3):675\u2013684","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9910_CR2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1002\/net.21536","volume":"63","author":"N Boland","year":"2014","unstructured":"Boland N, Kalinowski T, Kapoor R, Kaur S (2014) Scheduling unit time arc shutdowns to maximize network flow over time: complexity results. Networks 63(2):196\u2013202","journal-title":"Networks"},{"key":"9910_CR3","unstructured":"Boland N, Kalinowski T, Waterer H, Zheng L (2011) An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain. In: Baafi EY, Kininmonth RJ, Porter I (eds) Proceedings of the 35th APCOM symposium: applications of computers and operations research in the minerals industry, The Australasian Institute of Mining and Metallurgy Publication Series, pp 887\u2013897"},{"issue":"6","key":"9910_CR4","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10951-012-0284-y","volume":"16","author":"N Boland","year":"2013","unstructured":"Boland N, Kalinowski T, Waterer H, Zheng L (2013) Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J Sched 16(6):649\u2013659","journal-title":"J Sched"},{"issue":"1","key":"9910_CR5","doi-asserted-by":"crossref","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 (2014) Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret Appl Math 163(1):34\u201352","journal-title":"Discret Appl Math"},{"key":"9910_CR6","unstructured":"Boland N, McGowan B, Mendes A, Rigterink F (2013) Modelling the capacity of the Hunter Valley coal chain to support capacity alignment of maintenance activities. In: Piantadosi J, Anderssen RS, Boland J (eds) MODSIM2013, 20th international congress on modelling and simulation, Modelling and Simulation Society of Australia and New Zealand, pp 3302\u20133308"},{"key":"9910_CR7","volume-title":"Supply chain disruptions: theory and practice of managing risk","author":"N Boland","year":"2011","unstructured":"Boland N, Savelsbergh MWP (2011) Optimizing the Hunter Valley coal chain. In: Gurnani H, Mehrotra A, Ray S (eds) Supply chain disruptions: theory and practice of managing risk. Springer-Verlag, London Ltd., London"},{"issue":"3","key":"9910_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17(3):449\u2013467","journal-title":"Can J Math"},{"key":"9910_CR9","unstructured":"Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the 1st ACM-SIAM symposium on discrete algorithms, SODA 1990, pp 434\u2013443"},{"issue":"1","key":"9910_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.ejor.2014.10.003","volume":"242","author":"T Kalinowski","year":"2015","unstructured":"Kalinowski T, Matsypura D, Savelsbergh MWP (2015) Incremental network design with maximum flows. Eur J Oper Res 242(1):51\u201362","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9910_CR11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King V, Rao S, Tarjan R (1994) A faster deterministic maximum flow algorithm. J Algorithms 17(3):447\u2013474","journal-title":"J Algorithms"},{"key":"9910_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00186-011-0357-2","volume":"73","author":"R Koch","year":"2011","unstructured":"Koch R, Nasrabadi E, Skutella M (2011) Continuous and discrete flows over time. Math Methods Oper Res 73:301\u2013337","journal-title":"Math Methods Oper Res"},{"key":"9910_CR13","unstructured":"Kotnyek B (2003) An annotated overview of dynamic network flows. Technical Report 4936, INRIA"},{"key":"9910_CR14","unstructured":"Lid\u00e9n T (2014) Survey of railway maintenance activities from a planning perspective and literature review concerning the use of mathematical algorithms for solving such planning and scheduling problems. Technical report, Link\u00f6pings universitet"},{"key":"9910_CR15","unstructured":"Nurre SG (2013) Integrated network design and scheduling problems: Optimization algorithms and applications. PhD thesis, Rensselaer Polytechnic Institute. online: http:\/\/search.proquest.com\/docview\/1466024106"},{"issue":"3","key":"9910_CR16","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1016\/j.ejor.2012.07.010","volume":"223","author":"SG Nurre","year":"2012","unstructured":"Nurre SG, Cavdaroglu B, Mitchell JE, Sharkey TC, Wallace WA (2012) Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem. Eur J Oper Res 223(3):794\u2013806","journal-title":"Eur J Oper Res"},{"key":"9910_CR17","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1002\/net.21547","volume":"63","author":"SG Nurre","year":"2014","unstructured":"Nurre SG, Sharkey TC (2014) Integrated network design and scheduling problems with parallel identical machines: complexity results and dispatching rules. Networks 63:306\u2013326","journal-title":"Networks"},{"key":"9910_CR18","unstructured":"Orlin JB (2013) Max flows in $$O(nm)$$ O ( n m ) time, or better. In: Proceedings of the 45th ACM symposium on theory of computing (STOC 2013), ACM, pp 765\u2013774"},{"key":"9910_CR19","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo M (2008) Scheduling: theory, algorithms, and systems. Springer, New York"},{"key":"9910_CR20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research trends in combinatorial optimization","author":"M Skutella","year":"2009","unstructured":"Skutella M (2009) An introduction to network flows over time. In: Cook W, Lovasz L, Vygen J (eds) Research trends in combinatorial optimization. Springer, Berlin, pp 451\u2013482"},{"issue":"5","key":"9910_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/nav.20455","volume":"58","author":"M Tawarmalani","year":"2011","unstructured":"Tawarmalani M, Li Y (2011) Multi-period maintenance scheduling of tree networks with minimum flow disruption. Nav Res Logist 58(5):507\u2013530","journal-title":"Nav Res Logist"},{"key":"9910_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9910-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9910-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9910-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:27Z","timestamp":1559262207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9910-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,29]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9910"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9910-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,29]]}}}