

浏览全部资源
扫码关注微信
1.三峡大学机械与动力学院,湖北宜昌 443002
2.聊城大学计算机学院,山东聊城 252000
3.华中科技大学机械科学与工程学院,湖北武汉 430074
Received:27 November 2019,
Revised:2020-12-26,
Published:25 August 2021
移动端阅览
孟荣华,孙艾文,吴正佳等.改进灰狼算法求解复杂混合流水调度问题研究[J].电子学报,2021,49(08):1515-1523.
MENG Rong-hua,SUN Ai-wen,WU Zheng-jia,et al.Research on Complex Hybrid Flow-Shop Scheduling Problem Solved by Improved Grey Wolf Optimizer[J].ACTA ELECTRONICA SINICA,2021,49(08):1515-1523.
孟荣华,孙艾文,吴正佳等.改进灰狼算法求解复杂混合流水调度问题研究[J].电子学报,2021,49(08):1515-1523. DOI: 10.12263/DZXB.20191319.
MENG Rong-hua,SUN Ai-wen,WU Zheng-jia,et al.Research on Complex Hybrid Flow-Shop Scheduling Problem Solved by Improved Grey Wolf Optimizer[J].ACTA ELECTRONICA SINICA,2021,49(08):1515-1523. DOI: 10.12263/DZXB.20191319.
本文研究了带切割工序生产企业的工件调度优化问题.以最小化所有工件的最大完工时间为目标,建立了考虑一对多加工约束的混合流水调度问题的两阶段数学模型.设计了基于问题特征的协同奔袭灰狼算法,制定了新的编码规则和狼群分级策略,改进了探狼游走策略,并提出了猛狼协同奔袭策略.通过改进的标准算例对GA、GWO和CDGWO算法进行参数敏感性测试及求解对比.求解小规模问题时算法差异不明显,但是随着问题规模的增大,CDGWO求解效果性能稳定且进化效率较好.
This paper studies an optimization problem of the production scheduling with cutting process. A two-stage mathematical model of hybrid flow-shop scheduling problem with one-to-many constraints is established to minimize the makespan of all jobs. A cooperative attacking GWO is designed according to the problem feature
a new encoding scheme and the social hierarchy are developed. The search for the prey strategy is improved
and the collaborative running attack strategy is proposed. The sensitivity test and the results comparison of GA
GWO and CDGWO are carried out by the improved standard test. Algorithms are not significantly different when solving small-scale problems. As the scale increasing
the CDGWO performs very stable and the evolutionary efficiency shows very well.
Salvador M S . A solution to a special class of flow shop scheduling problems [A]. Symposium on the Theory of Scheduling and Its Applications [C]. Berlin Heidelberg Germany : Springer , 1973 . 83 - 91 .
任彩乐 , 张超勇 , 孟磊磊 , 等 . 基于改进候鸟优化算法的混合流水车间调度问题 [J]. 计算机集成制造系统 , 2019 , 25 ( 3 ): 643 - 653 .
Ren C L , Zhang C Y , Meng L L , et al . Hybrid flow-shop scheduling problems based on improved migrating birds optimization algorithm [J]. Computer Integrated Manufacturing Systems , 2019 , 25 ( 3 ): 643 - 653 . (in Chinese)
Ruiz R , Vázquez-Rodríguez J A . The hybrid flow shop scheduling problem [J]. European Journal of Operational Research , 2010 , 205 ( 1 ): 1 - 18 .
杜利珍 , 王震 , 柯善富 , 等 . 混合流水车间调度问题的果蝇优化算法求解 [J]. 中国机械工程 , 2019 , 30 ( 12 ): 1480 - 1485 .
Du L Z , Wang Z , Ke S F , et al . Fruit fly optimization algorithm for solving hybrid flow-shop scheduling problems [J]. China Mechanical Engineering , 2019 , 30 ( 12 ): 1480 - 1485 . (in Chinese)
王圣尧 , 王凌 , 许烨 , 等 . 求解混合流水车间调度问题的分布估计算法 [J]. 自动化学报 , 2012 , 38 ( 3 ): 437 - 443 .
Wang S Y , Wang L , Xu Y , et al . An estimation of distribution algorithm for solving hybrid flow-shop scheduling problem [J]. Acta Automatica Sinica , 2012 , 38 ( 3 ): 437 - 443 . (in Chinese)
姚远远 , 叶春明 , 杨枫 . 双目标可重入混合流水车间调度问题的离散灰狼优化算法 [J]. 运筹与管理 , 2019 , 28 ( 8 ): 190 - 199 .
Yao Y Y , Ye C M , Yang F . Solving Bi-objective reentrant hybrid flow shop scheduling problems by a hybrid discrete grey wolf optimizer [J]. Operations Research and Management Science , 2019 , 28 ( 8 ): 190 - 199 . (in Chinese)
Li J Q , Pan Q K . Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm [J]. Information Sciences , 2015 , 316 ( 1 ): 487 - 502 .
Lei D M . Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem [J]. Applied Soft Computing , 2015 , 34 : 721 - 727 .
Komaki G M , Teymourian E , Kayvanfar V . Minimising makespan in the two stage assembly hybrid flow shop scheduling problem using artificial immune systems [J]. International Journal of Production Research , 2016 , 54 ( 4 ): 963 - 983 .
Jun S , Park J . A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry [J]. Expert Systems with Applications , 2015 , 42 ( 15/16 ): 6196 - 6204 .
Liu S F , Wang P F , Zhang J C . An improved biogeography-based optimization algorithm for blocking flow shop scheduling problem [J]. Chinese Journal of Electronics , 2018 , 27 ( 2 ): 351 - 358 .
Murata T , Ishibuchi H , Tanaka H . Genetic algorithms for flowshop scheduling problems [J]. Computers & Industrial Engineering , 1996 , 30 ( 4 ): 1061 - 1071 .
Zhao F Q , Qin S , Yang G Q , et al . A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective [J]. Expert Systems with Applications , 2019 , 126 : 41 - 53 .
Mirjalili S , Mirjalili S M , Lewis A . Grey wolf optimizer [J]. Advances in Engineering Software , 2014 , 69 : 46 - 61 .
Zhang S , Zhou Y Q . Grey wolf optimizer with ranking-based mutation operator for IIR model identification [J]. Chinese Journal of Electronics , 2018 , 27 ( 5 ): 1071 - 1079 .
龙文 , 蔡绍洪 , 焦建军 , 等 . 一种改进的灰狼优化算法 [J]. 电子学报 , 2019 , 47 ( 1 ): 169 - 175 .
Long W , Cai S H , Jiao J J , et al . An improved grey wolf optimization algorithm [J]. Acta Electronica Sinica , 2019 , 47 ( 1 ): 169 - 175 . (in Chinese)
Komaki G M , Kayvanfar V . Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time [J]. Journal of Computational Science , 2015 , 8 : 109 - 120 .
Faris H , Aljarah I , Al-Betar M A , et al . Grey wolf optimizer: A review of recent variants and applications [J]. Neural Computing and Applications , 2018 , 30 ( 2 ): 413 - 435 .
Gupta J N D . Two-stage, hybrid flowshop scheduling problem [J]. Journal of the Operational Research Society , 1988 , 39 ( 4 ): 359 - 364 .
卢超 . 加工时间可控的多目标车间调度问题研究 [D]. 武汉 : 华中科技大学 , 2017 .
Lu C . Study on theory and method of multi-objective scheduling problems with controllable processing times [D]. Wuhan , China: Huazhong University of Science and Technology , 2017 . (in Chinese)
Liaw C F , Lin Y K , Cheng C Y , et al . Scheduling unrelated parallel machines to minimize total weighted tardiness [J]. Computers & Operations Research , 2003 , 30 ( 12 ): 1777 - 1789 .
Hariri A M A , Potts C N . A branch and bound algorithm for the two-stage assembly scheduling problem [J]. European Journal of Operational Research , 1997 , 103 ( 3 ): 547 - 556 .
0
Views
19
下载量
2
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621