A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

2005 ◽  
Vol 167 (2) ◽  
pp. 283-296 ◽  
Author(s):  
Simon Dunstall ◽  
Andrew Wirth
Keyword(s):  
Branch And Bound ◽  
Parallel Machines ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Branch And Bound Algorithms

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.

Sign in / Sign up

Export Citation Format

Share Document