Multi-family scheduling in a two-machine reentrant flow shop with setups.
Dar-Li YangWen-Hung KuoMaw-Sheng ChernPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- flowshop
- scheduling problem
- unrelated parallel machines
- sequence dependent setup times
- special case
- setup times
- maximum lateness
- parallel machines
- preventive maintenance
- processing times
- bicriteria
- flowshop scheduling
- job shop
- single machine
- minimizing makespan
- manufacturing cell
- np hard
- makespan minimization
- precedence constraints
- tabu search
- job processing times
- dispatching rule
- release dates
- robotic cell
- strongly np hard
- asymptotic optimality
- total weighted tardiness
- job shop scheduling problem
- permutation flowshop
- identical parallel machines
- job shop scheduling
- single machine scheduling problem
- open shop
- buffer allocation
- lot streaming
- flowshop scheduling problems
- cost function
- optimal solution
- parallel computing