Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics.
Rubén RuizConcepción MarotoJavier AlcarazPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- flowshop
- sequence dependent setup times
- scheduling problem
- makespan minimization
- tabu search
- total weighted tardiness
- single machine
- strongly np hard
- setup times
- maximum lateness
- combinatorial optimization
- minimizing total tardiness
- total tardiness
- single machine scheduling problem
- precedence constraints
- processing times
- parallel machines
- release dates
- np hard
- simulated annealing
- special case
- minimizing makespan
- job shop scheduling problem
- metaheuristic
- variable neighborhood search
- permutation flowshop
- particle swarm optimization
- memetic algorithm
- job shop
- lot sizing
- integer programming