A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions

Document Type

Article

Publication Date

8-1-2009

Abstract

We consider the problem of preemptively scheduling n independent jobs on m parallel machines so as to minimize the makespan. Each job Jj has a release time rj and it can only be processed on a subset of machines Mj. The machines are linearly ordered. Each job Jj has a machine index aj such that Mj = {Maj, Maj + 1, ..., Mm}. We first show that there is no 1-competitive online algorithm for this problem. We then give an offline algorithm with a running time of O (n k log P + m n k2 + m3 k), where k is the number of distinct release times and P is the total processing time of all jobs. © 2009 Elsevier B.V. All rights reserved.

Identifier

67349097086 (Scopus)

Publication Title

Discrete Optimization

External Full Text Location

https://doi.org/10.1016/j.disopt.2009.02.002

ISSN

15725286

First Page

292

Last Page

298

Issue

3

Volume

6

Grant

DMI-0556010

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS