Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies

DOI10.1016/j.cor.2015.05.011zbMath1349.90319arXiv1406.5562OpenAlexW1898981218WikidataQ57955314 ScholiaQ57955314MaRDI QIDQ342075

Simranjit Kaur, Thomas Kalinowski, Natashia Boland

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.5562

zbMATH Keywords

heuristicsmixed integer programmingtime discretizationnetwork modelsmaintenance scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items

Scheduling maintenance jobs in networks, Perspectives on integer programming for time-dependent models

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• On solving continuous-time dynamic network flows
• Continuous and discrete flows over time
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
• Principles of Sequencing and Scheduling
• Introduction to Scheduling
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• Multi-period maintenance scheduling of tree networks with minimum flow disruption
• Production Planning by Mixed Integer Programming
• Scheduling