The optimal number of used machines in a two-stage flexible flowshop scheduling problem.
Enrique GerstlGur MosheiovPublished in: J. Sched. (2014)
Keyphrases
- flowshop
- scheduling problem
- minimizing makespan
- processing times
- flowshop scheduling
- special case
- bicriteria
- maximum lateness
- total tardiness
- single machine
- parallel machines
- sequence dependent setup times
- np hard
- strongly np hard
- setup times
- tabu search
- makespan minimization
- minimizing total tardiness
- metaheuristic
- flowshop scheduling problems
- precedence constraints
- permutation flowshop
- linear combination
- dispatching rule