Fast approximation algorithms for job scheduling with processing set restrictions

Document Type

Article

Publication Date

10-25-2010

Abstract

We consider the problem of scheduling n independent jobs on m parallel machines, where the machines differ in their functionality but not in their processing speeds. Each job has a restricted set of machines to which it can be assigned, called its processing set. Preemption is not allowed. Our goal is to minimize the makespan of the schedule. We study two variants of this problem: (1) the case of tree-hierarchical processing set and (2) the case of nested processing set. We first give a fast algorithm for the case of tree-hierarchical processing set with a worst-case bound of 4/3, which is better than the best known algorithm whose worst-case bound is 2. We then give a more complicated algorithm for the case of nested processing set with a worst-case bound of 5/3, which is better than the best known algorithm whose worst-case bound is 7/4. In both cases, we will give examples achieving the worst-case bounds. © 2010 Elsevier B.V. All rights reserved.

Identifier

77957689068 (Scopus)

Publication Title

Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/j.tcs.2010.08.008

ISSN

03043975

First Page

3947

Last Page

3955

Issue

44-46

Volume

411

This document is currently not available here.

Share

COinS