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

Authors:
Aleksei V. Fishkin;Klaus Jansen;Sergey V. Sevastyanov;René Sitters
Affiliations:
Max-Planck-Institute für Informatik, Saarbrücken, Germany;Institute of Computer Science, University of Kiel, Kiel, Germany;Sobolev Institute of Mathematics, Novosibirsk, Russia;Max-Planck-Institute für Informatik, Saarbrücken, Germany
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 7
Cited 4

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 Trees with Large Communication Delays on Two Identical Processors

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Scheduling for hardware-software partitioning in embedded system design

Scheduling for hardware-software partitioning in embedded system design
Time bounds for selection

Journal of Computer and System Sciences

Problems column

ACM Transactions on Algorithms (TALG)
Preemptive scheduling in the presence of transportation times

Computers and Operations Research
Scheduling on parallel machines with preemption and transportation delays

Computers and Operations Research
Fast asymptotic FPTAS for packing fragmentable items with costs

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present hardness and approximation results for the problem of scheduling n independent jobs on m identical parallel machines subject to a migration delay d so as 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. We give initial results supporting a conjecture that there always exists an optimal schedule in which at most m – 1 jobs migrate. Further, we give a O(n) time O(1+1/log2n)-approximation algorithm for m = 2, and show that there is a polynomial time approximation scheme for arbitrary m.