Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms

2008 ◽  
Vol 42 (5-6) ◽  
pp. 581-594 ◽  
Author(s):  
Imran Ali Chaudhry ◽  
Paul R. Drake
Keyword(s):  
Genetic Algorithms ◽  
Parallel Machines ◽  
Machine Scheduling ◽  
Total Tardiness ◽  
Identical Parallel Machines ◽  
Assignment Problems ◽  
Worker Assignment

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.

Scheduling identical parallel machines to minimize total tardiness

2008 ◽  
Vol 115 (1) ◽  
pp. 134-142 ◽  
Author(s):  
Dirk Biskup ◽  
Jan Herrmann ◽  
Jatinder N.D. Gupta
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Identical Parallel Machines

SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

2010 ◽  
Vol 27 (05) ◽  
pp. 577-585 ◽  
Author(s):  
CHENG HE ◽  
YIXUN LIN ◽  
JINJIANG YUAN
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Np Hard ◽  
Assignment Problems ◽  
Running Time ◽  
Minimization Problems ◽  
Hierarchical Minimization

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time. And in this paper we present some algorithms for these problems with running time O(n log n).

Sign in / Sign up

Export Citation Format

Share Document