General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach.
Mohsen ZiaeePublished in: Inf. Sci. (2013)
Keyphrases
- flowshop
- sequence dependent setup times
- scheduling problem
- special case
- tabu search
- single machine
- setup times
- total weighted tardiness
- total tardiness
- minimizing total tardiness
- maximum lateness
- strongly np hard
- parallel machines
- precedence constraints
- processing times
- single machine scheduling problem
- np hard
- job shop scheduling problem
- release dates
- minimizing makespan
- permutation flowshop
- makespan minimization
- lot sizing
- approximation algorithms
- job shop
- completion times
- optimal solution
- integer programming
- combinatorial optimization
- computational complexity
- search algorithm