Open-Shop Scheduling for Unit Jobs Under Precedence Constraints.
An ZhangYong ChenRandy GoebelGuohui LinPublished in: COCOA (2018)
Keyphrases
- precedence constraints
- open shop scheduling
- scheduling problem
- branch and bound algorithm
- release dates
- parallel machines
- precedence relations
- single machine scheduling problem
- sequence dependent setup times
- ant colony optimisation
- maximum lateness
- vertex cover
- approximation algorithms
- global constraints
- setup times
- partially ordered
- identical machines
- partial order
- total tardiness
- single machine
- flowshop
- np hard
- processing times
- upper bound
- lower bound
- ant colony
- parallel computing
- branch and bound