An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times.
Roger Z. Ríos-MercadoJonathan F. BardPublished in: J. Heuristics (1999)
Keyphrases
- makespan minimization
- setup times
- flowshop
- scheduling problem
- tabu search
- unrelated parallel machines
- processing times
- sequence dependent setup times
- job shop scheduling problem
- optimal solution
- special case
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- lagrangian relaxation
- total weighted tardiness
- metaheuristic
- parallel machines
- np hard
- single machine
- genetic algorithm
- manufacturing cell
- simulated annealing
- lot sizing
- optimization problems
- memetic algorithm
- search space
- dynamic programming
- search procedure
- feasible solution
- single server
- single machine scheduling problem
- job shop
- search algorithm
- multi item
- branch and bound algorithm
- hybrid algorithm
- production scheduling
- lower bound
- integer programming
- precedence constraints
- computational complexity