Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

• Baxter M, Elgindy T, Ernst AT, Kalinowski T, Savelsbergh MWP (2014) Incremental network design with shortest paths. Eur J Oper Res 238(3):675–684

  Article  MathSciNet  MATH  Google Scholar 

• 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–202

  Article  MathSciNet  Google Scholar 

• 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–897

• 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–659

  Article  MathSciNet  Google Scholar 

• 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–52

  Article  MathSciNet  MATH  Google Scholar 

• 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–3308

• 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

  Google Scholar 

• Edmonds J (1965) Paths, trees, and flowers. Can J Math 17(3):449–467

  Article  MathSciNet  MATH  Google Scholar 

• 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–443

• Kalinowski T, Matsypura D, Savelsbergh MWP (2015) Incremental network design with maximum flows. Eur J Oper Res 242(1):51–62

  Article  MathSciNet  MATH  Google Scholar 

• King V, Rao S, Tarjan R (1994) A faster deterministic maximum flow algorithm. J Algorithms 17(3):447–474

  Article  MathSciNet  MATH  Google Scholar 

• Koch R, Nasrabadi E, Skutella M (2011) Continuous and discrete flows over time. Math Methods Oper Res 73:301–337

  Article  MathSciNet  MATH  Google Scholar 

• Kotnyek B (2003) An annotated overview of dynamic network flows. Technical Report 4936, INRIA

• Lidén 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öpings universitet

• 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

• 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–806

  Article  MathSciNet  MATH  Google Scholar 

• Nurre SG, Sharkey TC (2014) Integrated network design and scheduling problems with parallel identical machines: complexity results and dispatching rules. Networks 63:306–326

  Article  MathSciNet  Google Scholar 

• Orlin JB (2013) Max flows in \(O(nm)\) time, or better. In: Proceedings of the 45th ACM symposium on theory of computing (STOC 2013), ACM, pp 765–774

• Pinedo M (2008) Scheduling: theory, algorithms, and systems. Springer, New York

  MATH  Google Scholar 

• 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–482

  Chapter  Google Scholar 

• Tawarmalani M, Li Y (2011) Multi-period maintenance scheduling of tree networks with minimum flow disruption. Nav Res Logist 58(5):507–530

  Article  MathSciNet  MATH  Google Scholar 

• Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, New York

  Book  MATH  Google Scholar 

Download references