Preemptive scheduling on unrelated machines with fractional precedence constraints.
Vaneet AggarwalTian LanDheeraj PeddireddyPublished in: J. Parallel Distributed Comput. (2021)
Keyphrases
- single machine to minimize
- precedence constraints
- parallel machines
- preemptive scheduling
- scheduling problem
- parallel processors
- identical machines
- branch and bound algorithm
- number of late jobs
- total tardiness
- flowshop
- precedence relations
- approximation algorithms
- release dates
- vertex cover
- single machine scheduling problem
- maximum lateness
- sequence dependent setup times
- partial order
- series parallel
- global constraints
- unit length
- np hard
- partially ordered
- shared memory
- single machine
- partially ordered sets
- lower bound
- parallel computing
- genetic algorithm
- scheduling jobs
- processing times
- release times
- message passing
- objective function