IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v1y2007i2p223-243.html
   My bibliography  Save this article

Climbing depth-bounded discrepancy search for solving hybrid flow shop problems

Author

Listed:
  • Abir Ben Hmida
  • Marie-Jose Huguet
  • Pierre Lopez
  • Mohamed Haouari

Abstract

This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimises the makespan. We present here an adaptation of the Depth-bounded Discrepancy Search (DDS) method to obtain near-optimal solutions with makespan of high quality. This adaptation for the HFS contains no redundancy for the search tree expansion. To improve the solutions of our HFS problem, we propose a local search method, called Climbing Depth-bounded Discrepancy Search (CDDS), which is a hybridisation of two existing discrepancy-based methods: DDS and Climbing Discrepancy Search (CDS). CDDS introduces an intensification process around promising solutions. These methods are tested on benchmark problems. Results show that discrepancy methods give promising results and CDDS method gives the best solutions. [Received 27 October 2006; Revised 27 February 2007; Accepted 8 March 2007].

Suggested Citation

  • Abir Ben Hmida & Marie-Jose Huguet & Pierre Lopez & Mohamed Haouari, 2007. "Climbing depth-bounded discrepancy search for solving hybrid flow shop problems," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(2), pages 223-243.
  • Handle: RePEc:ids:eujine:v:1:y:2007:i:2:p:223-243
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=14110
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:1:y:2007:i:2:p:223-243. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.