|標題:||Preemptive Parallel-Machine Scheduling with a Common Server to Minimize Makespan|
|作者:||Cheng, T. C. E.|
Kravchenko, Svetlana A.
Lin, Bertrand M. T.
Department of Information Management and Finance
|關鍵字:||scheduling;parallel machines;common server;makespan;preemption|
|摘要:||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.|
|期刊:||NAVAL RESEARCH LOGISTICS|
|Appears in Collections:||Articles|