| Article ID: | iaor2002733 |
| Country: | United Kingdom |
| Volume: | 5 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 13 |
| Publication Date: | Jan 1993 |
| Journal: | IMA Journal of Mathematics Applied in Business and Industry |
| Authors: | White D.J. |
In this paper we consider a hybrid heuristic approach to a class of problems of assigning each job in a given set to one machine in a given set, to minimize the maximal completion time of all jobs. A special form of local optimality is introduced and it is shown that, for a special class of data, any heuristic can be extended to provide a solution with this local optimality property in a finite number of iterations. The results of this analysis are then used in a data partitioning scheme for a broader class of data to provide posterior bounds on loss of optimality.