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

DOI10.1007/s10878-015-9910-xzbMath1348.90471arXiv1307.3650OpenAlexW1949683236WikidataQ57955336 ScholiaQ57955336MaRDI QIDQ326488

Natashia Boland, Simranjit Kaur, Thomas Kalinowski

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3650

zbMATH Keywords

mixed integer programmingcomplexity theorynetwork modelsmaintenance scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items

Scheduling maintenance jobs in networks

Cites Work

• Unnamed Item
• Incremental network design with shortest paths
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• Continuous and discrete flows over time
• Incremental network design with maximum flows
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• An Introduction to Network Flows over Time
• The Design of Approximation Algorithms
• A Faster Deterministic Maximum Flow Algorithm
• Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• Multi-period maintenance scheduling of tree networks with minimum flow disruption
• Paths, Trees, and Flowers
• Max flows in O(nm) time, or better
• Scheduling