Online algorithms for scheduling two parallel machines with a single server

2014 ◽  
Vol 22 (5) ◽  
pp. 913-927 ◽  
Author(s):  
Yiwei Jiang ◽  
Feng Yu ◽  
Ping Zhou ◽  
Jueliang Hu
Keyword(s):  
Online Algorithms ◽  
Parallel Machines ◽  
Single Server

An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times

2014 ◽  
Vol 31 (05) ◽  
pp. 1450039 ◽  
Author(s):  
Yiwei Jiang ◽  
Huijuan Wang ◽  
Ping Zhou
Keyword(s):  
Parallel Machines ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Solution Algorithm ◽  
Single Server ◽  
Preemptive Scheduling ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Loading And Unloading

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.

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
Keyword(s):  
Parallel Machines ◽  
Single Server ◽  
Block Models

Minimising interference for scheduling two parallel machines with a single server

2014 ◽  
Vol 52 (24) ◽  
pp. 7148-7158 ◽  
Author(s):  
Keramat Hasani ◽  
Svetlana A. Kravchenko ◽  
Frank Werner
Keyword(s):  
Parallel Machines ◽  
Single Server

scholarly journals Online Algorithms for a Generalized Parallel Machine Scheduling Problem

MACRo 2015 ◽  
2015 ◽  
Vol 1 (1) ◽  
pp. 193-200
Author(s):  
István Szalkai ◽  
György Dósa
Keyword(s):  
Online Algorithms ◽  
Parallel Machines ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
The Other ◽  
Workflow Scheduling ◽  
Scheduling Problem ◽  
Parallel Machine Scheduling Problem

AbstractWe consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the second section. This problem is the generalization of the classical parallel machine scheduling problem, when the makespan is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests.

Sign in / Sign up

Export Citation Format

Share Document