Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time.
Tianyu WangOdile BellenguezPublished in: J. Sched. (2021)
Keyphrases
- precedence constraints
- unit length
- scheduling problem
- parallel machines
- precedence relations
- release dates
- branch and bound algorithm
- single machine to minimize
- sequence dependent setup times
- maximum lateness
- parallel processors
- single machine scheduling problem
- identical machines
- global constraints
- setup times
- series parallel
- approximation algorithms
- processing times
- vertex cover
- partial order
- identical parallel machines
- flowshop
- single machine
- partially ordered
- total tardiness
- lower bound
- job shop
- makespan minimization
- partially ordered sets
- np hard
- strongly np hard
- constraint satisfaction problems
- release times
- optimization problems