A two-machine flowshop scheduling problem with a separated maintenance constraint.
Dar-Li YangChou-Jung HsuWen-Hung KuoPublished in: Comput. Oper. Res. (2008)
Keyphrases
- flowshop
- scheduling problem
- preventive maintenance
- minimizing total tardiness
- processing times
- bicriteria
- sequence dependent setup times
- single machine
- setup times
- minimizing makespan
- flowshop scheduling
- total tardiness
- special case
- tabu search
- np hard
- total weighted tardiness
- parallel machines
- maximum lateness
- makespan minimization
- total flowtime
- precedence constraints
- job shop
- strongly np hard
- flowshop scheduling problems
- unrelated parallel machines
- robotic cell
- permutation flowshop
- maximum tardiness
- approximation algorithms
- search algorithm
- job shop scheduling problem
- linear programming
- lower bound