The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times.
Louis-Philippe BigrasMichel GamacheGilles SavardPublished in: Discret. Optim. (2008)
Keyphrases
- single machine scheduling problem
- traveling salesman problem
- sequence dependent setup times
- combinatorial optimization
- branch and bound algorithm
- release dates
- optimization problems
- metaheuristic
- processing times
- single machine
- simulated annealing
- ant colony optimization
- branch and bound
- precedence constraints
- resource consumption
- valid inequalities
- lower bound
- hybrid algorithm
- objective function
- resource allocation
- search procedure
- distributed systems
- dynamic programming