Scheduling on parallel machines with preemption and transportation delays

Authors:
Amina Haned;Ameur Soukhal;Mourad Boudhar;Nguyen Huynh Tuong
Affiliations:
Université Dely Brahim, Faculté des sciences économiques et de gestion, 2 rue Ahmed Waked, Dely Brahim, Alger, Algeria and Faculté de Mathématiques, Université USTHB, ...;Laboratoire d'Informatique, Université François Rabelais de Tours, 64 avenue Jean Portalis, 37200 Tours, France;Faculté de Mathématiques, Université USTHB, BP 32 Bab-Ezzouar, El-Alia 16111 Alger, Algeria;Faculty of Computer Science and Engineering, University of Technology of Ho Chi Minh City, Vietnam
Venue:
Computers and Operations Research
Year:
2012

Citing 14
Cited 0

The complexity of preemptive scheduling given interprocessor communication delays

Information Processing Letters
Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomially bounded minimization problems that are hard to approximate

Nordic Journal of Computing
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
An Optimal Real-Time Scheduling Algorithm for Multiprocessors

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Adapting Pfair scheduling for symmetric multiprocessors

Journal of Embedded Computing - Cache exploitation in embedded systems
Optimal Preemptive Scheduling on Two-Processor Systems

IEEE Transactions on Computers
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Preemptive scheduling in the presence of transportation times

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with an identical parallel machines scheduling problem, where independent jobs can be preempted and transported from one machine to another. The transportation of a preempted job requires a time called the transportation delay. The goal is to find a solution that minimizes the total completion time (makespan). We first study the case of equal-size jobs where new complexity results are given. Then, to solve the problem with two identical machines, we present a dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS). Experimental results show the efficiency of the FPTAS compared to a previously published heuristic.