An exact algorithm for the precedence-constrained single-machine scheduling problem.
Shunji TanakaShun SatoPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- single machine scheduling problem
- branch and bound algorithm
- lower bound
- release dates
- single machine scheduling
- weighted tardiness
- branch and bound
- precedence constraints
- upper bound
- lagrangian relaxation
- column generation
- optimal solution
- combinatorial optimization
- np hard
- integer programming
- processing times
- single machine
- resource consumption
- scheduling problem
- genetic algorithm
- shortest path problem
- minimize total
- computational complexity