Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems

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 sub-set of candidate machines. The aim is to find an allocation for each operation and to define the se-quence 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. Experiments have been performed on well-known benchmarks for flexible job shop scheduling.
Fichier principal
Vignette du fichier
MISTA07.pdf (350.11 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00155836 , version 1 (19-06-2007)

Identifiers

  • HAL Id : hal-00155836 , version 1

Cite

Abir Ben Hmida, Marie-José Huguet, Pierre Lopez, Mohamed Haouari. Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems. MISTA 2007, Aug 2007, Paris, France. pp.217-224. ⟨hal-00155836⟩
141 View
302 Download

Share

Gmail Mastodon Facebook X LinkedIn More