Minimizing total tardiness for scheduling identical parallel machines with family setups

2014 ◽  
Vol 72 ◽  
pp. 274-281 ◽  
Author(s):  
Jeffrey E. Schaller
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Identical Parallel Machines ◽  
Family Setups

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

Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

2012 ◽  
Vol 3 (1) ◽  
pp. 21-46 ◽  
Author(s):  
Farouk Yalaoui
Keyword(s):  
Ant Colony Algorithm ◽  
Parallel Machines ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Total Tardiness ◽  
Release Dates ◽  
Identical Parallel Machines ◽  
Priority Rules ◽  
Release Date ◽  
Exact Resolution

The considered problem is the scheduling of a set of jobs on identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant Colony Algorithm (ACO), a Tabu Search (TS) method, a set of Heuristics based on priority rules and an adapted Biskup Hermann Gupta (BHG) method are proposed to solve the problem. The obtained results are discussed and analyzed.

Sign in / Sign up

Export Citation Format

Share Document