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

Mohamed Messaoudi-Ouchene and Ali Derbala
Additional contact information
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

International Journal of Applied Metaheuristic Computing (IJAMC), 2013, vol. 4, issue 3, 65-74

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijamc.2013070105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:4:y:2013:i:3:p:65-74

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().