The complexity of preemptive scheduling given interprocessor communication delays

doi:10.1016/0020-0190(87)90231-6

Information Processing Letters

Volume 25, Issue 2, 6 May 1987, Pages 123-125

https://doi.org/10.1016/0020-0190(87)90231-6 Get rights and content

Abstract

We discuss the problem of scheduling af set of independent tasks T, each t_i ϵ T of lenght ℓ_i ϵ Z⁺, on m identical processors. We allow preemption but assume a communication delay of time k ϵ N. Whenever a task is preempted from one processor to another, there must be a delay of at least k time units. We show that if k = 1, an optimal schedule can be found in polynomial time but if k ⩾ 2, the corresponding decision problem is NP-complete.

References (7)

T. Agerwala
Communication, computation and computer architecture
D.H. Cornett et al.
Scheduling independent tasks with communications

There are more references available in the full text version of this article.

Cited by (10)

Parallel machine scheduling problem with preemptive jobs and transportation delay
2014, Computers and Operations Research
Citation Excerpt :
Boudhar and Haned [4] name this changeover time as transportation delay. Rayward-Smith [5] considers the idea of transportation delay in interprocessor communication delays. He studies scheduling independent jobs with preemption on identical parallel machine in order to minimize makespan by considering equal transportation delay time for jobs among machines and shows that the problem is NP-complete.
In this research the parallel machine scheduling problem with preemption by considering a constant transportation delay for migrated jobs and minimization of makespan as the criterion i.e., P_m|pmtn(delay)|C_max is investigated. It is assumed that when a preempted job resumes on another machine, it is required a delay between the processing time of the job on these two machines. This delay is called transportation delay. We criticize an existing mathematical model for the research problem in the literature [Boudhar M, Haned A. Preemptive scheduling in the presence of transportation times. Computers & Operations Research 2009; 36(8):2387–93]. Then, we prove that there exists an optimal schedule with at most (m−1) preemptions with transportation among machines for the problem. We also propose a linear programming formulation and an exact algorithm for the research problem in case of equal transportation delay. The experiments show that the proposed exact algorithm performs better than the proposed mathematical model.
Scheduling on parallel machines with preemption and transportation delays
2012, Computers and Operations Research
Citation Excerpt :
Several problems with preemption and another constraint have been studied (see [3,4] for more details). The concept of transportation of the preempted jobs onto parallel machines has been considered by Rayward-Smith [10], he has studied the complexity of the problem. Fishkin et al. [11] have studied the case with identical transportation delays which they called the migration delays.
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.
Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms
1993, Mathematics and Computers in Simulation
Scheduling problems deal with the assignment of tasks, over time, to processors, so as to optimize a performance criterion, while satisfying a set of given constraints. In this paper a comprehensive survey of the major results in this area is presented. Specifically, a unified formulation of deterministic scheduling models (problems) is provided on the basis of the three standard data fields, viz. the task set, the processor set, and the optimality criterion set. Some particular practical interpretations of these problems are briefly outlined, and a general discussion on their solution approaches is included. The main body of the paper examines the classes of “parallel processor scheduling” and “resource constrained scheduling” problems. In both classes the following cases are considered: (i) makespan minimization, (ii) maximum lateness minimization, (iii) mean and mean weighted flow time minimization, and (iv) maximum weighted lateness minimization. The paper ends with a discussion of some problems of the sequencing, open-shop, job-shop and flow-shop types, and with some remarks on the potentiality of artificial intelligence and expert systems to solve difficult scheduling problems.
Sequencing and scheduling: Algorithms and complexity
1993, Handbooks in Operations Research and Management Science
This chapter discusses different types of sequencing and scheduling problems, and describes different types of algorithms and the concepts of complexity theory. A class of deterministic machine scheduling problems has been introduced in the chapter. The chapter also deals with the single machine, parallel machine and multi-operation problems in this class, respectively. The two generalizations of the deterministic machine-scheduling model have been presented in the chapter. A deterministic scheduling model may give rise to various stochastic counterparts, as there is a choice in the parameters that are randomized, in their distributions, and in the classes of policies that can be applied. A characteristic feature of these models is that the stochastic parameters are regarded as independent random variables with a given distribution and that their realization occurs only after the scheduling decision has been made. In the deterministic model, one has perfect information, and capitalizing on it in minimizing the realization of a performance measure may require exponential time.
Multiprocessor scheduling with communication delays
1990, Parallel Computing
Preemptive scheduling with transportation delays between machines
2020, Journal of Modelling in Management

View all citing articles on Scopus

View full text

The complexity of preemptive scheduling given interprocessor communication delays

Abstract

Communication, computation and computer architecture

Scheduling independent tasks with communications