scholarly journals Several semi-online scheduling problems on two identical machines with combined information

2012 ◽  
Vol 457 ◽  
pp. 35-44 ◽  
Author(s):  
Qian Cao ◽  
T.C.E. Cheng ◽  
Guohua Wan ◽  
Yi Li
Keyword(s):  
Online Scheduling ◽  
Scheduling Problems ◽  
Identical 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 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 A $2.28$-competitive algorithm for online scheduling on identical machines

2015 ◽  
Vol 11 (1) ◽  
pp. 185-198 ◽  
Author(s):  
Jiping Tao ◽  
◽  
Ronghuan Huang ◽  
Tundong Liu
Keyword(s):  
Online Scheduling ◽  
Competitive Algorithm ◽  
Identical Machines

Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing

2019 ◽  
Vol 36 (01) ◽  
pp. 1950002
Author(s):  
Xianglai Qi ◽  
Jinjiang Yuan
Keyword(s):  
Load Balancing ◽  
Online Algorithms ◽  
Processing Time ◽  
Scheduling Problems ◽  
Total Processing Time ◽  
Hierarchical Scheduling ◽  
Lp Norm ◽  
Maximum Value ◽  
Identical Machines ◽  
Two Machines

This paper investigates semi-online hierarchical scheduling problems on two identical machines, with the purpose of minimizing the [Formula: see text]-norm of the machines’ loads. We consider two semi-online versions with knowing the total processing time [Formula: see text] of all jobs, or knowing the total processing time [Formula: see text] of the jobs of hierarchy [Formula: see text] for [Formula: see text] in advance. For the two semi-online versions, the best possible online algorithms are designed with competitive ratios of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is the maximum value of the function [Formula: see text] in [Formula: see text]. When [Formula: see text], our results cover the known results for minimizing the makespan.

Sign in / Sign up

Export Citation Format

Share Document