Name
Abstract | ||
|---|---|---|
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 O ( n log n ) time is presented. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0305-0548(91)90042-P | Computers & OR |
Keywords | DocType | Volume |
linear programming model,load balancing | Journal | 18 |
Issue | ISSN | Citations |
1 | Computers and Operations Research | 2 |
PageRank | References | Authors |
0.43 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manlio Gaudioso | 1 | 207 | 23.95 |
| Pasquale Legato | 2 | 282 | 20.44 |