New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
J. A. HoogeveenH. OosterhoutSteef L. van de VeldePublished in: Oper. Res. (1994)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- upper and lower bounds
- lower bounding
- scheduling problem
- association rules
- round robin
- valid inequalities
- lagrangian relaxation
- branch and bound algorithm
- exact and approximate
- parallel machines
- multiple objectives
- scheduling algorithm
- data sets
- branch and bound
- resource allocation
- small number
- data structure
- real world