Preemptive Parallel-Machine Scheduling with a Common Server to Minimize Makespan

被引：10
|
作者：
Cheng, T. C. E. [1 ]
Kravchenko, Svetlana A. [2 ]
Lin, Bertrand M. T. [3 ]
机构：
[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
[2] United Inst Informat Problems, Minsk 220012, BELARUS
[3] Natl Chiao Tung Univ, Inst Informat Management, Hsinchu 300, Taiwan
来源：
NAVAL RESEARCH LOGISTICS | 2017年 / 64卷 / 05期
关键词：
scheduling; parallel machines; common server; makespan; preemption;
D O I：
10.1002/nav.21762
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider parallel-machine scheduling with a common server and job preemption to minimize the makespan. While the non-preemptive version of the problem is strongly NP-hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP-hard even if there is a fixed number of machines. We give a pseudo-polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP-hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. (C) 2017 Wiley Periodicals, Inc.
引用
收藏
页码：388 / 398
页数：11
相关论文
共 50 条
12345