scholarly journals Better Algorithm for Order On-Line Scheduling on Uniform Machines

2019 ◽  
Vol 09 (02) ◽  
pp. 59-65
Author(s):  
Rongheng Li ◽  
Yunxia Zhou
Keyword(s):  
Uniform Machines ◽  
On Line

Randomized on-line scheduling on two uniform machines

2001 ◽  
Vol 4 (2) ◽  
pp. 71-92 ◽  
Author(s):  
Leah Epstein ◽  
John Noga ◽  
Steve Seiden ◽  
Ji?� Sgall ◽  
Gerhard Woeginger
Keyword(s):  
Uniform Machines ◽  
On Line

SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES

2005 ◽  
Vol 22 (02) ◽  
pp. 229-237 ◽  
Author(s):  
RUN-ZI LUO ◽  
SHI-JIE SUN
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Processing Time ◽  
Scheduling Problem ◽  
Uniform Machines ◽  
On Line ◽  
Special Case

In this paper, we investigate a semi-on-line version for a special case of three machines M1, M2, M3 where the processing time of the largest job is known in advance. A speed si(s1 = s2 = 1, 1 ≤ s3 = s) is associated with machine Mi. Our goal is to maximize the C min — the minimum workload of three machines. We give a C min 3 algorithm and prove its competitive ratio is [Formula: see text] and the algorithm is the best possible for 1 ≤ s ≤ 2. We also claim the competitive ratio of algorithm C min 3 is tight.

On-line preemptive machine scheduling with $$\ell _p$$ ℓ p norm on two uniform machines

2014 ◽  
Vol 18 (2) ◽  
pp. 185-194 ◽  
Author(s):  
Tianping Shuai ◽  
Donglei Du ◽  
Xiaoyue Jiang
Keyword(s):  
Machine Scheduling ◽  
Uniform Machines ◽  
On Line

scholarly journals On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines

2016 ◽  
Vol 08 (04) ◽  
pp. 98-102
Author(s):  
Xiayan Cheng ◽  
Rongheng Li ◽  
Yunxia Zhou
Keyword(s):  
Release Times ◽  
Uniform Machines ◽  
On Line
Sign in / Sign up

Export Citation Format

Share Document