Scheduling Under Common Due Date, A Single Resource and Precedence Constraints - A Dynamic Approach.
Konstantin KoganPublished in: Discret. Event Dyn. Syst. (1998)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- parallel machines
- release dates
- precedence relations
- parallel processors
- maximum lateness
- approximation algorithms
- sequence dependent setup times
- resource allocation
- single machine
- series parallel
- partial order
- setup times
- vertex cover
- single machine scheduling problem
- partially ordered
- unit length
- partially ordered sets
- global constraints
- np hard
- lower bound
- parallel computing
- flowshop
- dynamic programming
- resource consumption
- multi objective
- optimal solution