Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness.
Peter BruckerMichael R. GareyDavid S. JohnsonPublished in: Math. Oper. Res. (1977)
Keyphrases
- precedence constraints
- maximum lateness
- equal length
- scheduling problem
- single machine
- release dates
- branch and bound algorithm
- parallel machines
- sequence dependent setup times
- precedence relations
- batch processing machines
- parallel processors
- approximation algorithms
- flowshop
- global constraints
- partially ordered
- single machine scheduling problem
- setup times
- partial order
- completion times
- np hard
- tabu search
- branch and bound
- combinatorial optimization
- np complete