Skip to Main content Skip to Navigation
Journal articles

Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02497465
Contributor : Daniel Gavrysiak <>
Submitted on : Tuesday, March 3, 2020 - 4:31:03 PM
Last modification on : Thursday, April 23, 2020 - 9:50:08 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

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

Share

Metrics

Record views

42