Journal article

Scheduling arc maintenance jobs in a network to maximize total flow over time

Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng

Discrete Applied Mathematics | ELSEVIER SCIENCE BV | Published : 2014

Abstract

We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures critical to modern life. For example, utilities such as water, sewerage and electricity all flow over networks. Products are manufactured and transported via supply chain networks. Such networks need regular, planned maintenance in order to continue to function. However the coordinated timing of maintenance jobs can have a major impact on the ..

View full abstract

University of Melbourne Researchers

Grants

Awarded by HVCCC


Awarded by Australian Research Council


Funding Acknowledgements

We like to acknowledge the valuable contributions of Jonathon Vandervoort, Rob Oyston, Tracey Giles, and the Capacity Planning Team from the Hunter Valley Coal Chain Coordinator (HVCCC) P/L. Without their patience, support, and feedback, this research could not have occurred. We also thank the HVCCC and the Australian Research Council for their joint funding under the ARC Linkage Grant no. LP0990739. Furthermore, we are very grateful to the anonymous referees for their helpful comments and suggestions.