Ant Colony Optimization Algorithm to Minimize Makespan and Number of Tardy Jobs in Flexible Flowshop Systems

被引：0

作者：

Niebles Atencio, Fabricio ^{[1
]}

Solano-Charris, Elyn L. ^{[1
]}

Montoya-Torres, Jairo R. ^{[1
]}

机构：

[1] Univ La Sabana, Escuela Int Ciencias Econ & Adm, Chia, Cundinamarca, Colombia

来源：

2012 XXXVIII CONFERENCIA LATINOAMERICANA EN INFORMATICA (CLEI) | 2012年

关键词：

hybrid flowshop; ant colony algorithm; multi-objective; SHOP;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper studies the problem of scheduling a set of jobs in a hybrid flowshop. Since this problem is known to be NP-hard, a meta-heuristic procedure based on Ant Colony Optimization (ACO) is proposed. The paper considers the multi-objective problem of minimizing both the makespan and the number of tardy jobs. An experimental study is carried out using well-known instances from the literature. Because this is the first time in literature that these two objectives are considered simultaneously for the hybrid flowshop problem, the proposed procedure is compared with mono-objective heuristics for each optimization criterion. Experimental results show the efficiency and effectiveness of the proposed ACO algorithm.

引用

页数：10

共 50 条

[1] An improved Ant Colony Optimization Algorithm for Permutation Flowshop Scheduling to Minimize Makespan
Zhang, Zhiqiang
Jing, Zhang
[J]. 2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012), 2012, : 605 - 609
[2] Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
Rajendran, C
Ziegler, H
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (02) : 426 - 438
[3] Two-machine flowshop scheduling to minimize the number of tardy jobs
Gupta, JND
Hariri, AMA
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (02) : 212 - 220
[4] No-wait flowshop scheduling problem to minimize the number of tardy jobs
Tariq A. Aldowaisan
Ali Allahverdi
[J]. The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
[5] No-wait flowshop scheduling problem to minimize the number of tardy jobs
Aldowaisan, Tariq A.
Allahverdi, Ali
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4): : 311 - 323
[6] A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING
Bancila, Daniel
Buzatu, Constantin
[J]. ANNALS OF DAAAM FOR 2008 & PROCEEDINGS OF THE 19TH INTERNATIONAL DAAAM SYMPOSIUM, 2008, : 69 - 70
[7] SEQUENCING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
LAWLER, EL
[J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (05): : 27 - 33
[8] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Abbasali Jafari
Ghasem Moslehi
[J]. Journal of Global Optimization, 2012, 54 : 389 - 404
[9] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Jafari, Abbasali
Moslehi, Ghasem
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (02) : 389 - 404
[10] A BRANCH AND BOUND ALGORITHM TO MINIMIZE THE NUMBER OF LATE JOBS IN A PERMUTATION FLOWSHOP
HARIRI, AMA
POTTS, CN
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) : 228 - 237

← 1 2 3 4 5 →