The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
From MaRDI portal
Publication:322558
DOI10.1016/j.ejor.2015.10.038zbMath1346.90274MaRDI QIDQ322558
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.038
complexity results; deterministic maintenance problem; polyhedral properties; scheduling maintenance activities
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
90B10: Deterministic network models in operations research
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- A characterization of the uncapacitated network design polytope
- On the application of mathematical models in maintenance
- A primal-dual interior point method whose running time depends only on the constraint matrix
- The scheduling of maintenance service
- The simple plant location problem: Survey and synthesis
- Scheduling flexible maintenance activities subject to job-dependent machine deterioration
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Modeling and solving the periodic maintenance problem
- Machine scheduling with an availability constraint
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- Integral Simplex Using Decomposition for the Set Partitioning Problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
