| Article ID: | iaor1991986 |
| Country: | United Kingdom |
| Volume: | 18 |
| Start Page Number: | 59 |
| End Page Number: | 64 |
| Publication Date: | Jan 1991 |
| Journal: | Computers and Operations Research |
| Authors: | Gaudioso M., Legato P. |
| Keywords: | programming: linear |
The problem of optimally sharing a given workload among a number of machines under a presently known load level is formulated both as a linear program and as a partitioning problem. An interpretation of the problem in terms of scheduling theory is described, and an exact algorithm running in