Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
檔案
本條目沒有附加檔案。
日期
1970-01-01
期刊名稱
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
摘要
We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binaryNP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines.