Parallel Machine Scheduling with a Single Server: Loading and Unloading

Author(s):  
Jueliang Hu ◽  
Qinghui Zhang ◽  
Jianming Dong ◽  
Yiwei Jiang
2014 ◽  
Vol 31 (05) ◽  
pp. 1450039 ◽  
Author(s):  
Yiwei Jiang ◽  
Huijuan Wang ◽  
Ping Zhou

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 ◽  
Vol 30 (2) ◽  
pp. 201-213 ◽  
Author(s):  
Yiwei Jiang ◽  
Qinghui Zhang ◽  
Jueliang Hu ◽  
Jianming Dong ◽  
Min Ji

2017 ◽  
Vol 58 ◽  
pp. 306
Author(s):  
Jianming Dong ◽  
Xueshi Wang ◽  
Liliang Wang ◽  
Jueliang Hu

2021 ◽  
Vol 132 ◽  
pp. 105315
Author(s):  
Nadia Brauner ◽  
Mikhail Y. Kovalyov ◽  
Alain Quilliot ◽  
Hélène Toussaint

Sign in / Sign up

Export Citation Format

Share Document