scholarly journals Two semi-online scheduling problems on two uniform machines

2009 ◽  
Vol 410 (8-10) ◽  
pp. 776-792 ◽  
Author(s):  
C.T. Ng ◽  
Zhiyi Tan ◽  
Yong He ◽  
T.C.E. Cheng
Keyword(s):  
Online Scheduling ◽  
Scheduling Problems ◽  
Uniform Machines

scholarly journals Semi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Taibo Luo ◽  
Yinfeng Xu
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Partial Information ◽  
Online Scheduling ◽  
Scheduling Problems ◽  
Total Processing Time ◽  
Grade Of Service ◽  
Two Machines

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of3/2,20/13, and4/3which are shown to be optimal.

scholarly journals Online scheduling on two uniform machines subject to eligibility constraints

2009 ◽  
Vol 410 (38-40) ◽  
pp. 3975-3981 ◽  
Author(s):  
Kangbok Lee ◽  
Joseph Y.-T. Leung ◽  
Michael L. Pinedo
Keyword(s):  
Online Scheduling ◽  
Uniform Machines

scholarly journals Online scheduling with reassignment on two uniform machines

2010 ◽  
Vol 411 (31-33) ◽  
pp. 2890-2898 ◽  
Author(s):  
Qian Cao ◽  
Zhaohui Liu
Keyword(s):  
Online Scheduling ◽  
Uniform Machines
Sign in / Sign up

Export Citation Format

Share Document