Mixed integer programming formulations for single machine scheduling problems.
Ahmet B. KehaKetan KhowalaJohn W. FowlerPublished in: Comput. Ind. Eng. (2009)
Keyphrases
- mixed integer programming
- single machine scheduling problem
- piecewise linear functions
- lagrangian relaxation
- valid inequalities
- column generation
- branch and bound algorithm
- integer programming
- lower bound
- lp relaxation
- lot sizing
- mixed integer
- combinatorial optimization
- feasible solution
- processing times
- single machine
- linear programming
- branch and bound
- lower and upper bounds
- production planning
- precedence constraints
- np hard
- search procedure
- dynamic programming
- shortest path
- upper bound
- optimal solution
- genetic algorithm
- hybrid algorithm
- cutting plane
- resource consumption