Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints.
K. R. BakerEugene L. LawlerJan Karel LenstraA. H. G. Rinnooy KanPublished in: Oper. Res. (1983)
Keyphrases
- single machine to minimize
- precedence constraints
- release dates
- scheduling problem
- branch and bound algorithm
- single machine scheduling problem
- sequence dependent setup times
- approximation algorithms
- parallel machines
- partially ordered
- partial order
- setup times
- global constraints
- single machine
- scheduling jobs
- release times
- np hard
- processing times
- optimal solution
- total cost
- total tardiness
- flowshop
- worst case
- upper bound