Minimizing sum of completion times and makespan in master-slave systems

Document Type

Article

Publication Date

8-1-2006

Abstract

We consider scheduling problems in the master-slave model. In this model, each job has to be processed sequentially in three stages. In the first stage, a preprocessing task runs on a master machine, in the second stage, a slave task runs on a dedicated slave machine, and, in the last stage, a postprocessing task again runs on a master machine, possibly different from the master machine in the first stage. It has been shown that the problem of minimizing the makespan or the sum of completion times is NP-hard in the strong sense even if preemption is allowed. In this paper, we design efficient approximation algorithms to minimize the sum of completion times in various settings. These are the first general results for the minsum problem in the master-slave model. We also show that these algorithms generate schedules with small makespan as well. © 2006 IEEE.

Identifier

33746882771 (Scopus)

Publication Title

IEEE Transactions on Computers

External Full Text Location

https://doi.org/10.1109/TC.2006.128

ISSN

00189340

First Page

985

Last Page

999

Issue

8

Volume

55

Grant

DMI-0300156

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS