Machine scheduling with soft precedence constraints.
An ZhangXiangtong QiGuanhua LiPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- approximation algorithms
- parallel machines
- release dates
- sequence dependent setup times
- vertex cover
- partially ordered
- maximum lateness
- parallel processors
- series parallel
- global constraints
- single machine scheduling problem
- single machine
- partial order
- unit length
- tabu search
- total tardiness
- partially ordered sets
- setup times
- branch and bound
- flowshop
- combinatorial optimization
- probabilistic model
- optimal solution
- neural network