A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime.
Victor Fernandez-ViagasRainer LeistenJose M. FramiñanPublished in: Expert Syst. Appl. (2016)
Keyphrases
- flowshop scheduling problems
- total flowtime
- flowshop
- flowshop scheduling
- scheduling problem
- minimizing makespan
- permutation flowshop
- special case
- processing times
- setup times
- tabu search
- sequence dependent setup times
- maximum lateness
- asymptotic optimality
- greedy algorithm
- upper bound
- neural network
- parallel machines
- np hard
- search space
- search algorithm