IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i1p29-43.html
   My bibliography  Save this article

An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

Author

Listed:
  • Safa Khalouli

    (University of Reims Champagne-Ardenne, France)

  • Fatima Ghedjati

    (University of Reims Champagne-Ardenne, France)

  • Abdelaziz Hamzaoui

    (University of Reims Champagne-Ardenne, France)

Abstract

An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan. To solve this NP-hard problem, the IACS-HFS considers the assignment and sequencing sub-problems simultaneously in the construction procedures. The performance of the algorithm is evaluated by numerical experiments on benchmark problems taken from the literature. The results show that the proposed ant colony optimization algorithm gives promising and good results and outperforms some current approaches in the quality of schedules.

Suggested Citation

  • Safa Khalouli & Fatima Ghedjati & Abdelaziz Hamzaoui, 2011. "An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(1), pages 29-43, January.
  • Handle: RePEc:igg:jamc00:v:2:y:2011:i:1:p:29-43
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:2:y:2011:i:1:p:29-43. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.