Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates.
Zhen LiuEric SanlavillePublished in: Discret. Appl. Math. (1995)
Keyphrases
- single machine to minimize
- precedence constraints
- preemptive scheduling
- scheduling problem
- branch and bound algorithm
- processing times
- total tardiness
- precedence relations
- setup times
- partially ordered
- parallel machines
- partial order
- release dates
- maximum lateness
- approximation algorithms
- single machine
- vertex cover
- global constraints
- parallel processors
- partially ordered sets
- sequence dependent setup times
- lower bound
- series parallel
- single machine scheduling problem
- optimal solution
- flowshop
- unit length
- constraint satisfaction
- special case