An exact algorithm for the preemptive single machine scheduling of equal-length jobs.
Artem FominBoris GoldengorinPublished in: Comput. Oper. Res. (2022)
Keyphrases
- single machine scheduling
- equal length
- single machine scheduling problem
- branch and bound algorithm
- processing times
- lower bound
- single machine
- scheduling problem
- branch and bound
- precedence constraints
- upper bound
- column generation
- optimal solution
- np hard
- scheduling algorithm
- completion times
- combinatorial optimization
- integer programming
- dynamic programming
- competitive ratio
- lagrangian relaxation