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

@article{Boland2016SchedulingAS,
  title={Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period},
  author={Natashia Boland and Thomas Kalinowski and Simranjit Kaur},
  journal={J. Comb. Optim.},
  year={2016},
  volume={32},
  pages={885-905}
}
We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning period, which will require each to be shut down for exactly one time period. In general this problem is… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.
3 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

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

  • T. Lidén
  • Technical report, Linköpings universitet,
  • 2014
1 Excerpt

Integrated network design and scheduling problems: Optimization algorithms and applications

  • S. G. Nurre
  • PhD thesis, Rensselaer Polytechnic Institute,
  • 2013
1 Excerpt

Similar Papers

Loading similar papers…