Special cases of traveling salesman and repairman problems with time windows (original) (raw)
Related papers
Scheduling Problems over Network of Machines
2017
Scheduling problems over a network of machines
Journal of Scheduling, 2018
The Shortest Path Problem with Time Windows and Linear Waiting Costs
Guy Desaulniers, Daniel Villeneuve
Transportation Science, 2000
Algorithms for Scheduling and Routing Problems
2016
The traveling salesman problem with time-dependent service times
European Journal of Operational Research, 2016
Transportation Science, 2009
Mathematical Methods of Operational Research, 2004
Complexity and Reducibility of the Skip Delivery Problem
M.Grazia Speranza, Claudia Archetti
Transportation Science, 2005
Discrete Optimization, 2008
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
Mathematical Programming, 1998
Two parallel machine sequencing problems involving controllable job processing times
European Journal of Operational Research, 1993
Path inequalities for the vehicle routing problem with time windows
Networks, 2007
Scheduling jobs of equal length: compleixty, facets and computational results
Computers & Operations Research, 2018
A better algorithm for an ancient scheduling problem
1994
Longest path analysis in networks of queues: Dynamic scheduling problems
European Journal of Operational Research, 2006
A heuristic for the resource-constrained traveling salesman problem
2002
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
2020
Special Issue on Algorithms for Scheduling Problems
Algorithms
Polynomially Solvable and NP-hard Special Cases for Scheduling with Heads and Tails
2022
Electronics and Communications in Japan Part Iii-fundamental Electronic Science - ELECTRON COMMUN JPN III, 1990
Scheduling : Theory, Algorithms, and Systems / M. Pinedo
Order scheduling models: hardness and algorithms
2007
Algorithms for Scheduling Problems
A parallel matheuristic for the Technician Routing and Scheduling Problem
2011
Optimization Models for Transport and Service Scheduling
Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine
Evgeny Gafarov, Александр Кварацхелия
Doklady Mathematics, 2007
A polyhedral study of the asymmetric traveling salesman problem with time windows
Matteo Fischetti, Martin Grötschel
Networks, 2000
On the dynamic technician routing and scheduling problem
Proceedings of the 5th …, 2012
A heap of pieces model for the cyclic job shop problem
HAL (Le Centre pour la Communication Scientifique Directe), 2014
The k-traveling repairman problem
Proceedings of the …, 2003