Online scheduling of equal-length jobs on parallel machines

Authors:
Jihuan Ding;Tomáš Ebenlendr;Jiří Sgall;Guochuan Zhang
Affiliations:
Dept. of Mathematics, Zhejiang Univ., Hangzhou, China and College of Operations Research and Management Science, Qufu Normal Univ., Rizhao, China;Institute of Mathematics, AS CR, Praha 1, Czech Republic;Institute of Mathematics, AS CR, Praha 1, Czech Republic;Dept. of Mathematics, Zhejiang Univ., Hangzhou, China
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 4
Cited 8

Online scheduling with hard deadlines

Journal of Algorithms
Admission control with immediate notification

Journal of Scheduling - Special issue: On-line scheduling
Online, non-preemptive scheduling of equal-length jobs on two identical machines

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online scheduling with hard deadlines on parallel machines

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

SIGACT news online algorithms column 13: 2007 - an offine perspective

ACM SIGACT News
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines

Approximation and Online Algorithms
Online preemptive scheduling with immediate decision or notification and penalties

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

Computers and Operations Research
Parallel machine problems with equal processing times: a survey

Journal of Scheduling
Dispatching equal-length jobs to parallel machines to maximize throughput

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Open problems in throughput scheduling

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Online scheduling with preemption or non-completion penalties

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e - 1) ≅ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algorithm. Our algorithm has an additional property called immediate decision: at each time, it is immediately decided for each newly released job if it will be scheduled, and if so, then also the time interval and machine where it is scheduled is fixed and cannot be changed later. We show that for two machines, no deterministic algorithm with immediate decision is better than 1.8-competitive; this lower bound shows that our algorithm is optimal for m = 2 in this restricted model. We give some additional lower bounds for algorithms with immediate decision.