Multi-period maintenance scheduling of tree networks with minimum flow disruption
From MaRDI portal
Publication:5198690
DOI10.1002/nav.20455zbMath1218.90079OpenAlexW2133853408MaRDI QIDQ5198690
Publication date: 9 August 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20455
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (3)
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 ⋮ An approach for bi-objective maintenance scheduling on a networked system with limited resources
Cites Work
- Pseudo-Boolean optimization
- Models for planning capacity expansion in local access telecommunication networks
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A shifting algorithm for continuous tree partitioning
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- New variants of bundle methods
- Theorems on linear combinatorial topology and general measure
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Design of Communication Networks with Survivability Constraints
- Scheduling of railway track maintenance activities and crews
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: Multi-period maintenance scheduling of tree networks with minimum flow disruption
