Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds.
Cyril BriandSamia OurariPublished in: RAIRO Oper. Res. (2013)
Keyphrases
- number of tardy jobs
- single machine scheduling problem
- lower and upper bounds
- lagrangian relaxation
- mixed integer programming
- lower bound
- upper bound
- branch and bound algorithm
- single machine
- processing times
- valid inequalities
- combinatorial optimization
- column generation
- feasible solution
- np hard
- branch and bound
- scheduling problem
- search procedure
- optimization problems
- precedence constraints
- dynamic programming