HAL : hal-00461981, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Computers & Operations Research / Computers and Operations Research 37, 12 (2010) p. 2192-2201

Discrepancy Search for the Flexible Job Shop Scheduling Problem

Abir Ben Hmida 1, 2, Mohamed Haouari 2, Marie-José Huguet 1, Pierre Lopez 1

(01/12/2010)

The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose a variant of the Climbing Discrepancy Search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.

1 :	Laboratoire d'analyse et d'architecture des systèmes (LAAS)
	CNRS : UPR8001 – Université Paul Sabatier - Toulouse III – Institut National Polytechnique de Toulouse - INPT – Institut National des Sciences Appliquées de Toulouse
2 :	Unité Recherche Opérationnelle pour l'Industrie (ROI)
	Ecole Polytechnique de Tunisie

Équipe de recherche : MOGISA

Domaine

:

Informatique/Recherche opérationnelle

Mots Clés : Scheduling – Allocation – Flexible Job Shop – Discrepancy Search – Neighborhood structures

hal-00461981, version 1

http://hal.archives-ouvertes.fr/hal-00461981

oai:hal.archives-ouvertes.fr:hal-00461981

Contributeur : Pierre Lopez <>

Soumis le : Lundi 8 Mars 2010, 09:59:58

Dernière modification le : Lundi 17 Mai 2010, 09:27:45