We consider the online scheduling problem on two parallel machines with the Grade of Service(GoS)eligibility constraints.The jobs arrive over time,and the objective is to minimize the makespan.We develop a(1+α)-compe...We consider the online scheduling problem on two parallel machines with the Grade of Service(GoS)eligibility constraints.The jobs arrive over time,and the objective is to minimize the makespan.We develop a(1+α)-competitive optimal algorithm,whereα≈0.555 is a solution ofα^(3)−2α^(2)−α+1=0.展开更多
基金the National Natural Science Foundation of China(No.11171106).
文摘We consider the online scheduling problem on two parallel machines with the Grade of Service(GoS)eligibility constraints.The jobs arrive over time,and the objective is to minimize the makespan.We develop a(1+α)-competitive optimal algorithm,whereα≈0.555 is a solution ofα^(3)−2α^(2)−α+1=0.
