An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness.
Yakov ZinderDuncan RoperPublished in: Ann. Oper. Res. (1998)
Keyphrases
- precedence constraints
- maximum lateness
- parallel machines
- scheduling problem
- single machine
- release dates
- single machine scheduling problem
- dynamic programming
- vertex cover
- np hard
- branch and bound algorithm
- precedence relations
- objective function
- cost function
- search space
- worst case
- optimal solution
- release times
- reinforcement learning
- sequence dependent setup times
- partially ordered
- lower and upper bounds
- constraint propagation
- flowshop