Scheduling problems in master-slave model

Document Type

Article

Publication Date

3-1-2008

Abstract

We consider scheduling problems in the master slave model, which was introduced by Sahni in 1996. The goal is to minimize the makespan and the total completion time. It has been shown that the problem of minimizing makespan is NP-hard. Sahni and Vairaktarakis developed some approximation algorithms to generate schedules whose makespan is at most constant times the optimal. In this paper, we show that the problem of minimizing total completion time is NP-hard in the strong sense. Then we develop algorithms to generate schedules whose total completion time and makespan are both bounded by some constants times their optimal values. © 2007 Springer Science+Business Media, LLC.

Identifier

38749121389 (Scopus)

Publication Title

Annals of Operations Research

External Full Text Location

https://doi.org/10.1007/s10479-007-0271-4

e-ISSN

15729338

ISSN

02545330

First Page

215

Last Page

231

Issue

1

Volume

159

Grant

DMI-0300156

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS