| Article ID: | iaor19971006 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 2 |
| Start Page Number: | 85 |
| End Page Number: | 87 |
| Publication Date: | Mar 1995 |
| Journal: | Operations Research Letters |
| Authors: | Kovalyov Mikhail Y. |
| Keywords: | scheduling |
A procedure to improve the lower and upper bound for the optimal objective function value of a minimization problem is presented. The procedure is based on an approximation scheme. Properties of this approximation scheme are established on which the correctness and effectiveness of the bound improvement procedure are based. The procedure is applied to improve the computational complexities of approximation algorithms for several single and parallel machine scheduling.