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

A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem: A Comparative Study

Author

Listed:
  • Mohamed Messaoudi-Ouchene

    (LAMDA-RO Laboratory, Mathematics Department, Faculty of Science, University Saad Dahlab of Blida, Blida, Algeria)

  • Ali Derbala

    (LAMDA-RO Laboratory, Mathematics Department, Faculty of Science, University Saad Dahlab of Blida, Blida, Algeria)

Abstract

This paper investigates a comparative study which addresses the P/prec/Cmax scheduling problem, a notable NP-hard benchmark. MLP_SACS, a modified ant colony algorithm, is used to solve it. Its application provides us a better job allocation to machines. In front of each machine, the jobs are performed with three priority rules, the longest path (LP), a modified longest path (MLP) and a maximum between two values (MAX). With these three rules and with both static and dynamic information heuristics called “visibility”, six versions of this ant colony algorithm are obtained, studied and compared. The comparative study analyzes the following four meta-heuristics, simulated annealing, taboo search, genetic algorithm and MLP_SACS (a modified ant colony system), is performed. The solutions obtained by the MLP_SACS algorithm are shown to be the best.

Suggested Citation

  • Mohamed Messaoudi-Ouchene & Ali Derbala, 2013. "A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem: A Comparative Study," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 4(3), pages 65-74, July.
    • Handle: RePEc:igg:jamc00:v:4:y:2013:i:3:p:65-74
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2013070105
    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:4:y:2013:i:3:p:65-74. 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.