Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information

2005 ◽  
pp. 422-432 ◽  
Author(s):  
Yong He ◽  
Yiwei Jiang
Keyword(s):  
Parallel Machines ◽  
Partial Information ◽  
Online Scheduling

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.

Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines

Optimization ◽  
2014 ◽  
Vol 63 (6) ◽  
pp. 867-882 ◽  
Author(s):  
Rongheng Li ◽  
Xiayan Cheng ◽  
Yunxia Zhou
Keyword(s):  
Parallel Machines ◽  
Online Scheduling ◽  
Release Times

Online Scheduling of Equal-Length Jobs on Parallel Machines

2007 ◽  
pp. 427-438 ◽  
Author(s):  
Jihuan Ding ◽  
Tomáš Ebenlendr ◽  
Jiří Sgall ◽  
Guochuan Zhang
Keyword(s):  
Parallel Machines ◽  
Online Scheduling ◽  
Equal Length
Sign in / Sign up

Export Citation Format

Share Document