Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Study of Bounds and Some Subproblems
Numerical and Experimentation Results
Conclusion
References
All Topics
Mathematics
Applied Mathematics

Preemptive scheduling in the presence of transportation times

Profile image of Mourad BoudharMourad Boudhar

2009, Computers & Operations Research

https://doi.org/10.1016/J.COR.2008.09.006
visibility

…

description

7 pages

link

1 file

Abstract

In this paper, we consider the problem of scheduling n independent jobs preemptively on m identical parallel machines, to minimize the total completion time (makespan). Each job J i (i = 1, n) has a processing time p i and the transportation of an interrupted job from a machine M j to another machine M j requires d jj units of time. We propose a linear programming formulation in real and binary decision variables and we prove that the problem is NP-hard. Some subproblems are analyzed and solved by polynomial algorithms. Finally we present some heuristics and give some lower bounds of the makespan.

Related papers

Preemptive scheduling on two identical parallel machines with a single transporter
Alan Soper

Journal of Combinatorial Optimization, 2012

We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that either solves the problem to optimality or in the worst case behaves as a fully polynomial-time approximation scheme.

View PDFchevron_right
An Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
Susan Rodger

1988

ABSTRACT In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion time and deadline.

View PDFchevron_right
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Claude M Le Pape

Operations Research Letters, 1999

Sevaux for many enlightening discussions on the topic of this paper. The author gratefully acknowledges the useful comments from the reviewer.

View PDFchevron_right
A polynomial algorithm for some preemptive multiprocessor task scheduling problems
Łukasz Kuszner

European Journal of Operational Research, 2007

In this paper we consider a problem of preemptive scheduling of multiprocessor tasks on dedicated processors in order to minimize the sum of completion times. Using a standard notation, our problem can be denoted as P j fix j , pmtn j P C j .

View PDFchevron_right
Integer preemptive scheduling on parallel machines
Jacques Carlier

Operations Research Letters, 2012

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function (e.g. total weighted tardiness and total weighted number of late jobs) has the following integer preemption property: for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting and completion times of jobs) occur at integer time points. J. Carlier), alvenko@math.nsc.ru (A. Kononov), Maurice.Queyranne@commerce.ubc.ca (M. Queyranne), seva@math.nsc.ru (S. Sevastyanov), sviri@dcs.warwick.ac.uk, M.I.Sviridenko@dcs.warwick.ac.uk (M. Sviridenko).

View PDFchevron_right
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
D. Pandelis

European Journal of Operational Research, 2007

We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine.

View PDFchevron_right
The single machine just-in-time scheduling problem with preemptions
yann hendel

2005

This paper deals with a variation of the single machine earliness/tardiness scheduling problem: preemption is allowed and, in order to penalize job interruptions, earliness costs depend on the starting time of the job while tardiness costs depend on the end times as in the usual models. We propose dominance properties and a polynomial time algorithm is given to solve the particular case where the sequence of the start and completion of the jobs is fixed.

View PDFchevron_right
Preemptive scheduling with transportation delays between machines
Mourad Boudhar

Journal of Modelling in Management, 2020

PurposeThis paper studies the preemptive scheduling problem of independent jobs on identical machines. The purpose of this paper is to minimize the makespan under the imposed constraints, namely, the ones that relate the transportation delays which are required to transport a preempted job from one machine to another. This study considers the case when the transportation delays are variable.Design/methodology/approachThe contribution is twofold. First, this study proposes a new linear programming formulation in real and binary decision variables. Then, this study proposes and implements a solution strategy, which consists of two stages. The goal of the first stage is to obtain the best machines order using a local search strategy. For the second stage, the objective is to determine the best possible sequence of jobs. To solve the preemptive scheduling problem with transportation delays, this study proposes a heuristic and two metaheuristics (simulated annealing and variable neighbor...

View PDFchevron_right
Preemptive Jobs Scheduling on Parallel Machines with Setup Times and Renewable Resources
Eugeniusz Toczylowski, Tomasz S'Liwin'Ski

2006

A two-stage algorithm for scheduling preemptive jobs on parallel machines with minimum makespan criterion and requirements for limited renewable resources and existence of sequence dependent setup times is investigated. In the first stage of the algorithm a set of best elementary feasible plans is obtained through column generation. For the second stage we compare genetic algorithms for sequencing elementary plans, where various approximate criterions for calculation minimum makespan are used.

View PDFchevron_right
On Preemptive Scheduling on Uniform Machines to Minimize Mean Flow Time
Svetlana Kravchenko

Computers & Operations Research, 2000

In this paper we give a polynomial algorithm for problem Q | rj,pj = p, pmtn | P Cj whose complexity status was open yet. The algorithm is based on a reduction of the scheduling problem to a linear program. The crucial condition for implementing the proposed reduction is the known or- der of job completion times.

View PDFchevron_right

References (13)

  1. Fishkin AV, Jansen K, Sevastyanov SV, Sitters R. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. Lecture notes in computer science, vol. 3669; 2005. p. 580-91.
  2. Baker KR. Introduction to sequencing and scheduling. New York: Wiley; 1974.
  3. Blazewicz J. Selected topics in scheduling theory. Annals of Discrete Mathematics 1987;31:1-60.
  4. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J. Scheduling computer and manufacturing processes. Berlin: Springer; 1996.
  5. Blazewicz J, Ecker KH, Schmidt G, Weglarz J. Scheduling in computer and manufacturing systems. Berlin: Springer-Lehrbuch; 1994.
  6. Brucker P. Scheduling algorithms. Berlin: Springer; 1995.
  7. Brucker P, Knust S. Complexity results of scheduling problems, page web, 2007 http://www.mathematik.uni-osnabrueck.de/research/OR/class/ .
  8. Berit J. Scheduling parallel jobs to minimize the makespan. Journal of Scheduling 2006;9:433-52.
  9. Chu C, Yalaoui F. An efficient heuristic approach for parallel machine scheduling with job splitting and sequence dependent setup times. IIE Transactions 2003;35:183-90.
  10. Boustta M. Minimisation du temps de fabrication sur une machine à injection avec réglages multiples, Thèse, Université Laval, Québec; 2003.
  11. Adjallah KH, Bettayeb B, Kacem I. Ordonnancement sur machines parallèles identiques avec temps de préparation par famille: application à la gestion des tâches de maintenance préventive. 6e Conférence Francophone de MOdélisation et SIMulation (MOSIM'06), Rabat, 2006.
  12. Jansen K, Mastrolilli M, Solis-Oba R. Approximation algorithms for flexible job shop problems. International Journal of Foundations of Computer Science 2005;16(2):361-79.
  13. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W.H. Freeman and Company; 1979.

Related papers

On Preemptive Scheduling of Unrelated Machines Using Linear Programming
Nodari Vakhania

arXiv (Cornell University), 2022

We consider a basic problem of preemptive scheduling of n nonsimultaneously released jobs on a group of m unrelated parallel machines so as to minimize maximum job completion time, the makespan. In the scheduling literature, the problem is commonly considered to be solvable in polynomial time by linear programming (LP) techniques proposed in Lawler and Labetoulle [4]. The authors in [4] give a LP formulation of the version with simultaneously released jobs and show how an optimal solution to this LP can be used to construct an optimal schedule to the latter problem. They also give a linear programming formulation of a related problem for non-simultaneously released jobs with the objective to minimize the maximum job lateness, and show how an optimal solution to this LP problem can be used to construct an optimal solution for non-simultaneously released jobs to minimize the maximum job lateness. As the current study shows, for non-simultaneously released jobs, unlikely, there exist a linear program such that a schedule with the minimum makespan can be constructed based on an optimal LP solution. We also prove that, in case no splitting of the same job on a machine is allowed (i.e., job part assigned to a machine is to be processed without an interruption on that machine), the problem is NPhard. As a side result, we obtain that, whenever job splitting is not allowed, given an optimal LP solution, it is NP-hard to find an optimal schedule with the minimum makespan that agrees with that LP solution. As another side result, we obtain that it is NP-hard to find an optimal schedule with at most m − 1 preemptions if jobs are released non-simultaneously. We also present two positive results. First, we construct an optimal schedule in a low degree polynomial time in case an optimal solution to a modified LP formulation that we propose already possesses "enough" amount of integer components so that it yields no more than m preempted jobs parts. We also propose a stronger mixed integer linear program formulation. Finally, we extend the schedule construction procedure based on an optimal LP solution from Lawler and Labetoulle [4] for non-simultaneously released jobs.

View PDFchevron_right
Scheduling preemptive jobs with precedence constraints on parallel machines
khaled djellab

1999

In parallel machine scheduling problems with general precedence constraints, it is advantageous to interrupt jobs and complete them at a later time in order to minimize Makespan. For general precedence constraints, we know that this problem is in the class of NP-hard combinatorial problems for which the development of ecient algorithms is unlikely. In this paper we propose two new heuristics SUPIO and INFIO which, respectively, give an upper bound and a lower bound to Makespan. We show numerically that the ratio between these two bounds is very close to one. SUPIO heuristic provides an optimal solution in the following cases: P2j `,pmntjg max , Pj forest,pmntjg max and Pj interval order,pmntjg max . Its absolute performance ratio is upper bounded by (2 À 2/m). We illustrate the eciency of our heuristics by computational results associated with randomly generated problems.We show in the conclusion that this new approach could solve some non-preemptive parallel machine scheduling problems.

View PDFchevron_right
Parallel machine scheduling problem with preemptive jobs and transportation delay
Nasser Salmasi

and sharing with colleagues.

View PDFchevron_right
Author's personal copy Parallel machine scheduling problem with preemptive jobs and transportation delay
Nasser Salmasi

and sharing with colleagues.

View PDFchevron_right
Minimizing total tardiness on parallel machines with preemptions
Svetlana Kravchenko, Frank Werner

Journal of Scheduling, Vol. 15, No. 2, 2013, 193 - 200, 2012

The basic scheduling problem we are dealing with in this paper is the following one. A set of jobs has to be scheduled on a set of parallel uniform machines. Each machine can handle at most one job at a time. Each job becomes available for processing at its release date. All jobs have the same execution requirement and arbitrary due dates. Each machine has a known speed. The processing of any job may be interrupted arbitrarily often and resumed later on any machine. The goal is to find a schedule that minimizes the sum of tardiness, i.e., we consider problem Q | r j , p j = p, pmtn | T j whose complexity status was open. Recently, Tian et al. proposed a polynomial algorithm for problem 1 | r j , p j = p, pmtn | T j . We show that both the problem P | pmtn | T j of minimizing total tardiness on a set of parallel machines with allowed preemptions and the problem P | r j , p j = p, pmtn | T j of minimizing total tardiness on a set of parallel machines with release dates, equal processing times and allowed preemptions are NP-hard. Moreover, we give a polynomial algorithm for the case of uniform machines without release dates, i.e., for problem Q | p j = p, pmtn | T j .

View PDFchevron_right

Related topics

  • Applied Mathematics
  • Computer Science
  • Mathematical Optimization
  • Job shop scheduling
  • Numerical Analysis and Computati...
  • LINEAR PROGRAM
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved