Linear programming models for load balancing
暂无分享，去创建一个
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.
[1] T. B. Tate,et al. Machine Scheduling Problems , 1978 .
[2] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[3] Kathryn E. Stecke,et al. Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems , 1983 .
[4] E. L. Lawler,et al. Recent Results in the Theory of Machine Scheduling , 1982, ISMP.
[5] Yung-Terng Wang,et al. Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.