Scheduling the distributed assembly flowshop problem to minimize the makespan

被引：15

作者：

Ochi, Hanadi ^{[1
]}

Driss, Olfa Belkahla ^{[2
,3
]}

机构：

[1] Inst Super Gest Tunis, 41 Ave Liberte, Tunis, Tunisia

[2] Univ Manouba, Ecole Super Commerce Tunis, Tunis, Tunisia

[3] Univ Manoouba, COSMOS Lab, ENSI, Manouba, Tunisia

来源：

CENTERIS2019--INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS/PROJMAN2019--INTERNATIONAL CONFERENCE ON PROJECT MANAGEMENT/HCIST2019--INTERNATIONAL CONFERENCE ON HEALTH AND SOCIAL CARE INFORMATION SYSTEMS AND TECHNOLOGIES | 2019年 / 164卷

关键词：

distributed assembly permutation flowshop scheduling problem (DAPFSP); iterated greedy algorithm; optimization; makespan; CHEMICAL-REACTION OPTIMIZATION; PERMUTATION; ALGORITHMS;

D O I：

10.1016/j.procs.2019.12.208

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we studied the distributed assembly permutation flowshop scheduling problem (DAPFSP) with the makespan minimization as objective. We proposed iterated greedy-based approach that is labelled the bounded-search iterated greedy algorithm BSIG. In addition, four local search methods are designed to improve solution quality. The computational results show the effectiveness of BSIG in solving the DAPFSP specially with small instances where BSIG outperforms most of the existing algorithms. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the scientific committee of the CENTERIS -International Conference on ENTERprise Information Systems / ProjMAN - International Conference on Project MANagement / HCist - International Conference on Health and Social Care Information Systems and Technologies.

引用

页码：471 / 477

页数：7

共 50 条

[31] The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time
Ali Allahverdi
Fawaz S. Al-Anzi
[J]. The International Journal of Advanced Manufacturing Technology, 2008, 37 : 166 - 177
[32] The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time
Allahverdi, Ali
Al-Anzi, Fawaz S.
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (1-2): : 166 - 177
[33] An enhanced genetic algorithm for the distributed assembly permutation flowshop scheduling problem
Zhang, Xin
Li, Xiang-Tao
Yin, Ming-Hao
[J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2020, 15 (02) : 113 - 124
[34] A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
Lian, Zhigang
Gu, Xingsheng
Jiao, Bin
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) : 773 - 785
[35] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
Lin, BMT
Cheng, TCE
[J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624
[36] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
Engin, Orhan
Gunaydin, Cengiz
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (04) : 521 - 529
[37] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
Engin O.
Günaydin C.
[J]. International Journal of Computational Intelligence Systems, 2011, 4 (4) : 521 - 529
[38] A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop
Lee, Ik Sun
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020
[39] 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
[40] Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E.
Wu, Chin-Chia
Chen, Juei-Chao
Wu, Wen-Hsiang
Cheng, Shuenn-Ren
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 79 - 86

← 1 2 3 4 5 →