DocumentCode :
1012503
Title :
Minimizing sum of completion times and makespan in master-slave systems
Author :
Leung, Joseph Y T ; Zhao, Hairong
Author_Institution :
Dept. of Comput. Sci., New Jersey Inst. of Technol., Newark, NJ
Volume :
55
Issue :
8
fYear :
2006
Firstpage :
985
Lastpage :
999
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
Keywords :
computational complexity; linear programming; scheduling; NP-hard problem; approximation algorithm; completion time minimization; job processing; linear programming; makespan minimization; master-slave system; minsum problem; preemptive scheduling; scheduling problem; Application software; Approximation algorithms; Concurrent computing; Job shop scheduling; Master-slave; Processor scheduling; Scheduling algorithm; Semiconductor device manufacture; Semiconductor device modeling; Yarn; Sequence and scheduling; approximation algorithms; linear programming.; makespan;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2006.128
Filename :
1650196
Link To Document :
بازگشت