Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.
Jill R. HardinGeorge L. NemhauserMartin W. P. SavelsberghPublished in: Discret. Optim. (2008)
Keyphrases
- resource constrained
- resource requirements
- valid inequalities
- scheduling problem
- integer programming
- feasible solution
- tabu search
- np hard
- resource constraints
- linear programming
- traveling salesman problem
- sensor networks
- resource allocation
- lower and upper bounds
- mixed integer programming
- single machine
- mixed integer
- wireless sensor networks
- convex hull
- column generation
- cutting plane
- resource consumption
- processing times
- primal dual
- integer program
- flowshop
- lagrangian relaxation
- optimal solution
- scheduling algorithm
- lower bound
- embedded systems
- vehicle routing problem
- upper bound
- search algorithm