Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times.
Tao XuXia ZhuXiaoping LiPublished in: CSCWD (2012)
Keyphrases
- flowshop
- sequence dependent setup times
- greedy algorithm
- scheduling problem
- total flowtime
- single machine
- total tardiness
- setup times
- parallel machines
- permutation flowshop
- maximum lateness
- total weighted tardiness
- single machine scheduling problem
- precedence constraints
- minimizing total tardiness
- processing times
- flowshop scheduling
- special case
- release dates
- minimizing makespan
- lot sizing
- tabu search
- worst case
- dynamic programming
- knapsack problem
- cost function
- strongly np hard
- job shop scheduling problem
- multistage