Block models for scheduling jobs on two parallel machines with a single server

2014 ◽  
Vol 41 ◽  
pp. 94-97 ◽  
Author(s):  
Keramat Hasani ◽  
Svetlana A. Kravchenko ◽  
Frank Werner
2014 ◽  
Vol 22 (5) ◽  
pp. 913-927 ◽  
Author(s):  
Yiwei Jiang ◽  
Feng Yu ◽  
Ping Zhou ◽  
Jueliang Hu

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 52 (24) ◽  
pp. 7148-7158 ◽  
Author(s):  
Keramat Hasani ◽  
Svetlana A. Kravchenko ◽  
Frank Werner

2004 ◽  
Vol 31 (11) ◽  
pp. 1867-1889 ◽  
Author(s):  
Amir H. Abdekhodaee ◽  
Andrew Wirth ◽  
Heng Soon Gan

2006 ◽  
Vol 33 (4) ◽  
pp. 994-1009 ◽  
Author(s):  
Amir H. Abdekhodaee ◽  
Andrew Wirth ◽  
Heng-Soon Gan

Sign in / Sign up

Export Citation Format

Share Document