Linear programming models for load balancing

From MaRDI portal





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.











This page was built for publication: Linear programming models for load balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810365)