Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates - Archive ouverte HAL Access content directly
Journal Articles International Journal of Applied Evolutionary Computation Year : 2012

Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

(1)
1

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.
Not file

Dates and versions

hal-02497465 , version 1 (03-03-2020)

Identifiers

Cite

Farouk Yalaoui. Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates. International Journal of Applied Evolutionary Computation, 2012, 3 (1), pp.21-46. ⟨10.4018/jaec.2012010102⟩. ⟨hal-02497465⟩

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More