Makespan preserving flowshop reengineering via blocking constraints.
M. A. Hakim NewtonVahid RiahiAbdul SattarPublished in: Comput. Oper. Res. (2019)
Keyphrases
- flowshop
- scheduling problem
- minimizing makespan
- processing times
- flowshop scheduling
- special case
- bicriteria
- total tardiness
- lot streaming
- flowshop scheduling problems
- setup times
- maximum lateness
- precedence constraints
- tabu search
- unrelated parallel machines
- total flowtime
- maximum tardiness
- sequence dependent setup times
- parallel machines
- single machine
- total weighted tardiness
- makespan minimization
- strongly np hard
- constraint programming
- job shop
- preventive maintenance
- global constraints
- np hard