机器有使用限制的两台同类机排序的在线LS算法
Online Algorithms LS of the Two Uniform Machines Scheduling with an Availability Constraint
-
摘要: 研究了机器有使用限制的两台同类机排序问题的在线算法,对于Q2 a(M1)Cmax和Q2 a(M2)Cmax问题,证明了LS算法的竞争比分别为1 s12和s2 s12,并举例说明了这两个界是紧的。Abstract: 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.