A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility.
Rubén RuizConcepción MarotoPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- sequence dependent setup times
- flowshop
- total weighted tardiness
- total tardiness
- genetic algorithm
- scheduling problem
- single machine
- parallel machines
- minimizing makespan
- single machine scheduling problem
- tabu search
- setup times
- parallel machine scheduling problem
- release dates
- precedence constraints
- lot sizing
- processing times
- job shop scheduling problem
- multi objective
- simulated annealing
- strongly np hard
- ant colony optimization
- metaheuristic
- hybrid algorithm
- special case
- neural network
- setup cost
- multistage
- np hard
- dynamic programming
- optimization problems
- lagrangian relaxation
- branch and bound algorithm