Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints.
Sergey VoronovJames H. AndersonKecheng YangPublished in: Real Time Syst. (2021)
Keyphrases
- precedence constraints
- scheduling problem
- parallel machines
- single machine scheduling problem
- sequence dependent setup times
- release dates
- branch and bound algorithm
- single machine
- precedence relations
- lower bound
- maximum lateness
- setup times
- flowshop
- parallel processors
- processing times
- upper bound
- vertex cover
- minimize total
- release times
- np hard
- scheduling jobs
- global constraints
- approximation algorithms
- tabu search
- partially ordered sets
- unit length
- partial order
- branch and bound
- identical machines
- series parallel
- partially ordered
- job shop scheduling problem
- combinatorial optimization
- linear programming