Preemptive semi-online scheduling with tightly-grouped processing times

Authors:
Yong He;Yi-Wei Jiang
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou 310027, P.R. China;State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 5
Cited 0

Semi on-line scheduling on two identical machines

Computing
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates a preemptive semi-online scheduling problem on m identical parallel machines where m = 2, 3. It is assumed that all jobs have their processing times in between p and rp (p 0, r ≥ 1). The goal is to minimize the makespan. Best possible algorithms are designed for any r ≥ 1 when m = 2, 3.