Scheduling arc maintenance jobs in a network to maximize total flow over time
From MaRDI portal
Publication:406493
DOI10.1016/j.dam.2012.05.027zbMath1297.90031OpenAlexW2052429767WikidataQ57955352 ScholiaQ57955352MaRDI QIDQ406493
Hamish Waterer, Thomas Kalinowski, Natashia Boland, Lanbo Zheng
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.027
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (7)
Scheduling maintenance jobs in networks ⋮ Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period ⋮ Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ Temporal flows in temporal networks ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous and discrete flows over time
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Universally maximum flow with piecewise-constant capacities
- An Introduction to Network Flows over Time
- Decomposing inventory routing problems with approximate value functions
- Optimal dynamic routing in communication networks with continuous traffic
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Scheduling
This page was built for publication: Scheduling arc maintenance jobs in a network to maximize total flow over time
