New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
J. A. HoogeveenH. OosterhoutSteef L. van de VeldePublished in: IPCO (1992)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- lower bounding
- upper and lower bounds
- scheduling problem
- scheduling algorithm
- lagrangian relaxation
- valid inequalities
- small number
- resource constraints
- lagrangian dual
- exact and approximate
- round robin
- parallel machines
- data sets
- resource allocation
- search algorithm
- data mining