Improved bounded dynamic programming algorithm for solving the blocking flow shop problem.
Ansis OzolinsPublished in: Central Eur. J. Oper. Res. (2019)
Keyphrases
- flowshop
- scheduling problem
- asymptotic optimality
- asymptotically optimal
- flowshop scheduling problems
- special case
- processing times
- flowshop scheduling
- lot streaming
- setup times
- strongly np hard
- combinatorial optimization
- tabu search
- ant colony optimization
- sequence dependent setup times
- single machine
- job shop
- maximum lateness
- unrelated parallel machines
- expert systems