Minimizing makespan on a two-machine re-entrant flowshop.
S.-W. ChoiY.-D. KimPublished in: J. Oper. Res. Soc. (2007)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- total flowtime
- maximum tardiness
- special case
- bicriteria
- flowshop scheduling
- minimizing total tardiness
- tabu search
- processing times
- sequence dependent setup times
- maximum lateness
- setup times
- preventive maintenance
- total tardiness
- parallel machines
- flowshop scheduling problems
- single machine
- np hard
- robotic cell
- strongly np hard
- neural network
- precedence constraints
- job processing times
- permutation flowshop
- optimal solution