Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint.
Chung-Yee LeePublished in: Oper. Res. Lett. (1997)
Keyphrases
- flowshop
- scheduling problem
- minimizing total tardiness
- processing times
- flowshop scheduling
- single machine
- sequence dependent setup times
- setup times
- minimizing makespan
- bicriteria
- parallel machines
- tabu search
- makespan minimization
- special case
- total tardiness
- maximum lateness
- flowshop scheduling problems
- np hard
- unrelated parallel machines
- total flowtime
- robotic cell
- precedence constraints
- permutation flowshop
- preventive maintenance
- job shop scheduling problem
- total weighted tardiness
- strongly np hard
- job shop
- search algorithm
- release dates
- global constraints
- np complete