科研之友
微信
新浪微博
Facebook
分享链接
摘要
We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O(n log n) solution algorithm for the preemptive variant of the problem.
- 出版日期2014-10
- 单位浙江理工大学
