Scheduling the two-machine flowshop to hedge against processing time uncertainty.
Kuo-Ching YingPublished in: J. Oper. Res. Soc. (2015)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- minimizing total tardiness
- maximum lateness
- unrelated parallel machines
- parallel machines
- setup times
- preventive maintenance
- job shop
- single machine
- bicriteria
- processing times
- minimizing makespan
- makespan minimization
- flowshop scheduling
- precedence constraints
- total tardiness
- job processing times
- tabu search
- total weighted tardiness
- np hard
- manufacturing cell
- strongly np hard
- special case
- robotic cell
- number of tardy jobs
- dispatching rule
- permutation flowshop
- flowshop scheduling problems
- completion times
- release dates
- lot streaming
- single machine scheduling problem