A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Abstract : This paper considers the job-shop problem with release dates and due dates, with the objective of minimizing the total weighted tardiness. A genetic algorithm is combined with an iterated local search that uses a longest path approach on a disjunctive graph model. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Previous studies on genetic algorithms for the job-shop problem point out that these algorithms are highly depended on the way the chromosomes are decoded. In this paper, we show that the efficiency of genetic algorithms does no longer depend on the schedule builder when an iterated local search is used. Computational experiments carried out on instances of the literature show the efficiency of the proposed algorithm.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2008, 35 (8), pp.2599-2616. 〈10.1016/j.cor.2006.12.019〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00520349
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mercredi 22 septembre 2010 - 23:43:45
Dernière modification le : jeudi 15 mars 2018 - 14:28:03

Identifiants

Citation

Imen Essafi, Yazid Mati, Stéphane Dauzère-Pérès. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers and Operations Research, Elsevier, 2008, 35 (8), pp.2599-2616. 〈10.1016/j.cor.2006.12.019〉. 〈emse-00520349〉

Partager

Métriques

Consultations de la notice

227