An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives.
Rubén RuizThomas StützlePublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- sequence dependent setup times
- flowshop
- weighted tardiness
- scheduling problem
- setup times
- np hard
- special case
- processing times
- maximum lateness
- single machine
- greedy algorithm
- parallel machines
- tabu search
- precedence constraints
- strongly np hard
- knapsack problem
- optimal solution
- single machine scheduling problem
- job shop scheduling problem
- release dates
- approximation algorithms
- computational complexity