A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times.
Hossein BadriTayebeh BahreiniDaniel GrosuPublished in: Comput. Oper. Res. (2021)
Keyphrases
- cost function
- release dates
- single machine scheduling problem
- dynamic programming
- linear programming
- single machine
- objective function
- search space
- scheduling problem
- competitive ratio
- precedence constraints
- parallel machines
- parallel computing
- processing times
- worst case
- np hard
- lower bound
- computational complexity