| Article ID: | iaor19911980 |
| Country: | United Kingdom |
| Volume: | 42 |
| Issue: | 2 |
| Start Page Number: | 169 |
| End Page Number: | 172 |
| Publication Date: | Feb 1991 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Van de Vel H., Shijie S. |
A non-polynomial algorithm is presented for solving the minimum makespan problem on a set of uniform machines. This algorithm uses the bin-packing technique and provides an approximate solution which turns into an optimal one when the relative error is chosen small enough.