LI Hong-ying. Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2006, (9): 1134-1137.
Citation:
LI Hong-ying. Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2006, (9): 1134-1137.
LI Hong-ying. Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2006, (9): 1134-1137.
Citation:
LI Hong-ying. Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2006, (9): 1134-1137.
Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint
The online algorithms of two uniform machines scheduling problem with availability constraint are studied.The competitive ratios of LS algorithms of Q2|a(M_1)|C_(max) and Q2|a(M_2)|C_(max) are proved to be 1 1s_2 and s_2 1s_2 respectively.And the ratios are tight.
DownLoad: