Browsing by Author "Hmida, A. B."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Placeholder
    ArticlePublicationMetadata only
    Discrepancy search for the flexible job shop scheduling problem
    (Elsevier, 2010-12) Hmida, A. B.; Haouari, Mohamed; Huguet, M.-J.; Lopez, P.; Industrial Engineering; HAOUARI, Mohamed
    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.
  • Placeholder
    ArticlePublicationMetadata only
    Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
    (Elsevier, 2011-03) Hmida, A. B.; Haouari, Mohamed; Huguet, M.-J.; Lopez, P.; Industrial Engineering; HAOUARI, Mohamed
    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.