Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

被引：0

作者：

Ning ZHAO ^{[1
]}

Song YE ^{[1
]}

Kaidian LI ^{[1
]}

Siyu CHEN ^{[1
]}

机构：

[1] School of Mechanical Engineering, University of Science and Technology Beijing

来源：

Chinese Journal of Mechanical Engineering | 2017年 / 03期

基金：

中国国家自然科学基金;

关键词：

Permutation; Non-permutation; Flow shop; Time lags; Makespan; Iterated greedy algorithm;

D O I：

暂无

中图分类号：

TB497 [技术管理];

学科分类号：

08 ;

摘要：

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies.Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags)seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation(IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach.The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach.The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration,which provides an interesting viewpoint for industrial implementation.

引用

页码：652 / 662

页数：11

共 23 条

[1]

Engineering the Smart Factory[J]. HARRISON Robert,VERA Daniel,AHMAD Bilal.Chinese Journal of Mechanical Engineering. 2016(06)

[2]

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System[J]. WANG Yanyan,MOU Shandong,WU Yaohua.Chinese Journal of Mechanical Engineering. 2016(02)

[3]

Dynamic Topology Multi Force Particle Swarm Optimization Algorithm and Its Application[J]. CHEN Dongning,ZHANG Ruixing,YAO Chengyu,ZHAO Zheyu.Chinese Journal of Mechanical Engineering. 2016(01)

[4]

Energy-efficient Approach to Minimizing the Energy Consumption in An Extended Job-shop Scheduling Problem[J]. TANG Dunbing,DAI Min.Chinese Journal of Mechanical Engineering. 2015(05)

[5]

Emergency Local Searching Approach for Job Shop Scheduling[J]. ZHAO Ning,CHEN Siyu,DU Yanhua.Chinese Journal of Mechanical Engineering. 2013(05)

[6]

Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization[J]. SANG Hongyan1, 2, GAO Liang1, *, and PAN Quanke1, 3 1 State Key Lab. of Digital Manufacturing Equipment & Technology, Huazhong University of Science and Technology, Wuhan 430074, China 2 School of Mathematics Science, Liaocheng University, Liaocheng 252059, China 3 School of Computer Science, Liaocheng University, Liaocheng 252059, China.Chinese Journal of Mechanical Engineering. 2012(05)

[7]

Scatter search with path relinking for the job shop with time lags and setup times[J] . Miguel A. González,Angelo Oddi,Riccardo Rasconi,Ramiro Varela.Computers and Operations Research . 2015

[8] Accelerated methods for total tardiness minimisation in no-wait flowshops [J].

Ding, Jianya ;

Song, Shiji ;

Zhang, Rui ;

Gupta, Jatinder N. D. ;

Wu, Cheng .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (04) :1002-1018

[9]

Multi-objective flexible flow lines with due window, time lag, and job rejection[J] . Shaya Sheikh.The International Journal of Advanced Manufacturing Technology . 2013 (9)

[10] Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints [J].

Dhouib, E. ;

Teghem, J. ;

Loukil, T. .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2013, 20 (02) :213-232

← 1 2 3 →