Open-shop scheduling for unit jobs under precedence constraints.
Yong ChenRandy GoebelGuohui LinBing SuAn ZhangPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- precedence constraints
- open shop scheduling
- scheduling problem
- branch and bound algorithm
- parallel machines
- precedence relations
- release dates
- sequence dependent setup times
- single machine scheduling problem
- maximum lateness
- vertex cover
- partial order
- approximation algorithms
- setup times
- partially ordered
- global constraints
- single machine
- ant colony optimisation
- total tardiness
- processing times
- identical machines
- lower bound
- branch and bound
- np hard
- upper bound
- association rules