Solving the traveling repairman problem on a line with general processing times and deadlines

DOI10.1016/j.ejor.2015.02.009zbMath1346.90692OpenAlexW2038044577MaRDI QIDQ319440

Stefan Bock

Publication date: 6 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.02.009

zbMATH Keywords

branch-and-boundcomplexity analysisline-traveling repairman problemoptimal schedules

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (8)

The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ Finding optimal tour schedules on transportation paths under extended time window constraints ⋮ Integrated real-time control of mixed-model assembly lines and their part feeding processes ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Optimisation of maintenance routing and scheduling for offshore wind farms ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ The risk-averse traveling repairman problem with profits ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
• Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
• Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Dynamic fleet management. Concepts, systems, algorithms \& case studies
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Routing and Scheduling on a Shoreline with Release Times
• Saving an epsilon
• The complexity of the travelling repairman problem
• Special cases of traveling salesman and repairman problems with time windows
• Two-Processor Scheduling with Start-Times and Deadlines
• A note on the traveling repairman problem
• Scheduling

This page was built for publication: Solving the traveling repairman problem on a line with general processing times and deadlines