A bounded dynamic programming algorithm for the blocking flow shop problem.
Joaquín BautistaAlberto CanoRamón CompanysImma RibasPublished in: CIPLS (2011)
Keyphrases
- flowshop
- scheduling problem
- special case
- lot streaming
- asymptotic optimality
- flowshop scheduling problems
- flowshop scheduling
- sequence dependent setup times
- asymptotically optimal
- processing times
- setup times
- tabu search
- maximum lateness
- parallel machines
- np hard
- permutation flowshop
- multistage
- minimizing makespan
- single machine
- open shop
- unrelated parallel machines
- strongly np hard
- manufacturing cell
- job shop
- job shop scheduling