An approximation algorithm for parallel machine scheduling with a common server

被引：21
|
作者：
Wang, GQ
Cheng, TCE [1 ]
机构：
[1] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
[2] Jinan Univ, Guangzhou, Peoples R China
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2001年 / 52卷 / 02期
关键词：
parallel machine scheduling; approximation algorithm; worst-case analysis;
D O I：
10.1057/palgrave.jors.2601074
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we study the scheduling of a given set of jobs on several identical parallel machines tended by a common server. Each job must be processed on one of the machines. Prior to processing, the server has to set up the relevant machine. The objective is to schedule the jobs so as to minimize the total weighted job completion times. We provide an approximation algorithm to tackle this intractable problem and analyze the worst-case performance of the algorithm for the general, as well as a special, case of the problem.
引用
收藏
页码：234 / 237
页数：4
相关论文
共 50 条
12345