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

DOI10.1016/j.ejor.2015.02.009zbMath1346.90692MaRDI 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-bound; complexity analysis; line-traveling repairman problem; optimal schedules

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

Related Items

The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties, Finding optimal tour schedules on transportation paths under extended time window constraints, Optimisation of maintenance routing and scheduling for offshore wind farms, Weighted online minimum latency problem with edge uncertainty, 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, Integrated real-time control of mixed-model assembly lines and their part feeding processes

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