Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

Authors:
S. V. Sevastyanov;R. A. Sitters;A. V. Fishkin
Affiliations:
Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk State University, Novosibirsk, Russia;Free University, Amsterdam, Netherlands;Siemens AG Corporate Technology, Munchen, Germany
Venue:
Automation and Remote Control
Year:
2010

Citing 7
Cited 0

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Parallel processor scheduling with delay constraints

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling for hardware-software partitioning in embedded system design

Scheduling for hardware-software partitioning in embedded system design
Scheduling trees with large communication delays on two identical processors

Journal of Scheduling
Time bounds for selection

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present hardness and approximation results for the problem of preemptive scheduling of n independent jobs on m identical parallel machines subject to a migration delay d with the objective to minimize the makespan. We give a sharp threshold on the value of d for which the complexity of the problem changes from polynomial time solvable to NP-hard. Next, we give initial results supporting a conjecture that there always exists an optimal schedule with at most m 驴 1 job migrations. Finally, we provide a O(n) time (1 + 1/log2 n)-approximation algorithm for m = 2.