Scheduling arc maintenance jobs in a network to maximize total flow over time
DOI10.1016/J.DAM.2012.05.027zbMATH Open1297.90031DBLPjournals/dam/BolandKWZ14OpenAlexW2052429767WikidataQ57955352 ScholiaQ57955352MaRDI QIDQ406493FDOQ406493
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
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of applied optimization
- Scheduling
- Decomposing inventory routing problems with approximate value functions
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- An Introduction to Network Flows over Time
- Continuous and discrete flows over time
- Universally maximum flow with piecewise-constant capacities
- Optimal dynamic routing in communication networks with continuous traffic
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
Cited In (9)
- Temporal flows in temporal networks
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Scheduling maintenance jobs in networks
- Multi-period maintenance scheduling of tree networks with minimum flow disruption
- 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
- Approximation algorithms for the generalized incremental knapsack problem
Uses Software
This page was built for publication: Scheduling arc maintenance jobs in a network to maximize total flow over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406493)
