Discrepancy Search for the Flexible Job Shop Scheduling Problem - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2010

Discrepancy Search for the Flexible Job Shop Scheduling Problem

Abir Ben Hmida
  • Function : Author
Marie-José Huguet
Pierre Lopez

Abstract

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.
Fichier principal
Vignette du fichier
Flexible_Job_Shop-COR.pdf (945.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00461981 , version 1 (08-03-2010)

Identifiers

  • HAL Id : hal-00461981 , version 1

Cite

Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez. Discrepancy Search for the Flexible Job Shop Scheduling Problem. Computers and Operations Research, 2010, 37 (12), p. 2192-2201. ⟨hal-00461981⟩
3321 View
1704 Download

Share

Gmail Mastodon Facebook X LinkedIn More