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

DOI10.1016/J.DAM.2012.05.027MaRDI QIDQ406493zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Natashia Boland, Thomas Kalinowski, Hamish Waterer, 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

zbMATH Keywords

local searchnetwork flowsschedulinghybrid algorithmsmaintenance planning

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• 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
• Scheduling unit time arc shutdowns to maximize network flow over time: complexity results
• Multi-period maintenance scheduling of tree networks with minimum flow disruption

Cites work

• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• An introduction to network flows over time
• Continuous and discrete flows over time
• Decomposing inventory routing problems with approximate value functions
• Handbook of applied optimization
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• Optimal dynamic routing in communication networks with continuous traffic
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• Scheduling
• Universally maximum flow with piecewise-constant capacities

Cited in

(10)

• Workforce routing and scheduling for electricity network maintenance with downtime minimization
• 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
• Multi-period maintenance scheduling of tree networks with minimum flow disruption
• Scheduling unit time arc shutdowns to maximize network flow over time: complexity results
• Combined maintenance and routing optimization for large-scale sewage cleaning
• Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
• 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

Describes a project that uses

Uses Software

• Boost C++ Libraries
• Boost
• BGL

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)