A Model and Algorithm Analysis for Stochastic Online Scheduling on Uniform Machines[J]. Journal of East China University of Science and Technology, 2009, (6): 942-946.
Citation:
A Model and Algorithm Analysis for Stochastic Online Scheduling on Uniform Machines[J]. Journal of East China University of Science and Technology, 2009, (6): 942-946.
A Model and Algorithm Analysis for Stochastic Online Scheduling on Uniform Machines[J]. Journal of East China University of Science and Technology, 2009, (6): 942-946.
Citation:
A Model and Algorithm Analysis for Stochastic Online Scheduling on Uniform Machines[J]. Journal of East China University of Science and Technology, 2009, (6): 942-946.
A Model and Algorithm Analysis for Stochastic Online Scheduling on Uniform Machines
In this paper, we consider the stochastic online problem on m uniform parallel machines with the objective to minimize the total weighted expected completion times. In order to solve this problem, we first present a lower bound of the optimal value for the problem with the tool of linear programming relaxation, and then analyze the performance guarantee of the algorithm.
DownLoad: