| Article ID: | iaor20072554 |
| Country: | United Kingdom |
| Volume: | 58 |
| Issue: | 1 |
| Start Page Number: | 73 |
| End Page Number: | 79 |
| Publication Date: | Jan 2007 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Volgenant A., Zwiers I.Y. |
| Keywords: | scheduling |
We consider partial enumeration as a routine to improve heuristics in practice. For the multidimensional 0–1 knapsack problem and the single-machine weighted tardiness problem, known heuristics have been extended with partial enumeration. Various variants have been compared. The results show improvements in the obtained solutions at a modest extra effort in implementation and computing time.