Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

Authors:
Farouk Yalaoui
Affiliations:
University of Technology of Troyes, France
Venue:
International Journal of Applied Evolutionary Computation
Year:
2012

Citing 8
Cited 0

Scheduling parallel machines to minimize total weighted and unweighted tardiness

Computers and Operations Research
A tabu search algorithm for parallel machine total tardiness problem

Computers and Operations Research
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

Computers and Operations Research
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

Computers and Operations Research
Scheduling jobs on parallel machines with setup times and ready times

Computers and Industrial Engineering
A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates

Robotics and Computer-Integrated Manufacturing
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates

Computers and Operations Research
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.