-machine flowshop problem with unit-time operations and intree precedence constraints.
Igor AverbakhOded BermanIlya ChernykhPublished in: Oper. Res. Lett. (2005)
Keyphrases
- precedence constraints
- scheduling problem
- flowshop
- precedence relations
- minimizing total tardiness
- sequence dependent setup times
- parallel machines
- single machine
- processing times
- setup times
- flowshop scheduling
- single machine scheduling problem
- bicriteria
- release dates
- maximum lateness
- total tardiness
- makespan minimization
- np hard
- minimizing makespan
- tabu search
- strongly np hard
- total weighted tardiness
- flowshop scheduling problems
- job shop scheduling problem
- robotic cell
- search space
- preventive maintenance
- approximation algorithms
- job processing times