Solving Two-Stage Hybrid Flow Shop Using Climbing Depth-bounded Discrepancy Search - Archive ouverte HAL Access content directly
Journal Articles Computers & Industrial Engineering Year : 2011

Solving Two-Stage Hybrid Flow Shop Using Climbing Depth-bounded Discrepancy Search

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

Abstract

This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson's rule and on dedicated lower bounds for the two-stage hybrid flow shop problem. We report the results of extensive computational experiments, which show that the proposed adaptation of the CDDS method solves instances in restrained CPU time and with high quality of makespan.
Fichier principal
Vignette du fichier
2-stage-HFS_BenHmida.pdf (495.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00540266 , version 1 (26-11-2010)

Identifiers

  • HAL Id : hal-00540266 , version 1

Cite

Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez. Solving Two-Stage Hybrid Flow Shop Using Climbing Depth-bounded Discrepancy Search. Computers & Industrial Engineering, 2011, 60 (2), pp. 320-327. ⟨hal-00540266⟩
149 View
1241 Download

Share

Gmail Mastodon Facebook X LinkedIn More