The benefit of preemption for single machine scheduling so as to minimize total weighted completion time.
Leah EpsteinAsaf LevinPublished in: Oper. Res. Lett. (2016)
Keyphrases
- minimize total
- single machine scheduling
- single machine scheduling problem
- release dates
- parallel machines
- single machine
- precedence constraints
- processing times
- scheduling problem
- branch and bound algorithm
- total cost
- search procedure
- parallel computing
- cost function
- resource consumption
- computational complexity
- response time
- dynamic programming