Tardiness Bounds for Fixed-Priority Global Scheduling without Intra-Task Precedence Constraints.
Sergey VoronovJames H. AndersonKecheng YangPublished in: RTNS (2018)
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
- minimize total
- parallel processors
- vertex cover
- np hard
- maximum lateness
- flowshop
- setup times
- series parallel
- processing times
- upper bound
- approximation algorithms
- scheduling jobs
- partially ordered sets
- job shop scheduling problem
- tabu search
- release times
- partial order
- partially ordered
- parallel computing
- global constraints
- combinatorial optimization
- single server
- completion times
- lower and upper bounds
- error bounds
- np complete
- worst case
- unit length
- optimal solution