资源受限下单批耦合混合流水车间调度问题研究

doi:10.3969/j.issn.1007-7375.2023.04.014

工业工程 ›› 2023, Vol. 26 ›› Issue (4): 114-123.doi: 10.3969/j.issn.1007-7375.2023.04.014

资源受限下单批耦合混合流水车间调度问题研究

唐红涛^1,2, 刘子豪^1,2, 官思佳³

1. 武汉理工大学机电工程学院，湖北武汉 430070;
2. 武汉理工大学湖北省数字制造重点实验室，湖北武汉 430070;
3. 航天科工空间工程发展有限公司，北京 100854

收稿日期:2022-09-19 发布日期:2023-09-08
作者简介:唐红涛(1987-),男,湖北省人,副教授,博士,主要研究方向为智能制造、智能优化算法及应用
基金资助:
国家自然科学基金资助项目 (52075401)

Scheduling Problem of Hybrid Flow Shops Considering Resource Constraints and Single Batch Coupling

TANG Hongtao^1,2, LIU Zihao^1,2, GUAN Sijia³

1. School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China;
2. Hubei Key Laboratory of Digital Manufacturing, Wuhan University of Technology, Wuhan 430070, China;
3. CASIC Space Engineering Development Co., Ltd, Beijing 100854, China

Received:2022-09-19 Published:2023-09-08

摘要/Abstract

摘要： 混合流水车间存在于许多工业制造领域，多约束的混合流水车间调度问题近年来被广泛研究，但是对于同时考虑资源受限和单批耦合的混合流水车间调度问题研究甚少。因此本文提出一种改进的离散蛙跳算法解决以最大完工时间和机器能耗为目标的混合流水车间问题。首先，针对单批耦合和资源受限问题设计一种编解码方式和改进的NEH初始化方法，其次引入外部解集设计一种改进的模因组搜索策略，最后通过生成的扩展算例和企业实际算例进行仿真实验，并与现有的算法进行对比，结果证明所提出算法解决此类问题的可行性和有效性。

关键词: 资源受限, 单批耦合, 蛙跳算法, 最大完工时间, 机器能耗

Abstract: Hybrid flow shops are widespread in many industrial manufacturing areas. The scheduling problem in hybrid flow shops with multiple constraints has been widely studied in recent years, but there is little study of the scheduling in hybrid flow shops that considers both resource constraints and single batch coupling. To this end, an improved discrete shuffled frog-leaping algorithm is proposed to solve the problem with the objective of minimizing the makespan and machine energy consumption. First, the encoding and decoding methods and an improved NEH initialization method are designed for the problem of single batch coupling and resource. Then, an improved memeplex search strategy is designed by introducing an external solution set. Finally, simulation experiments are conducted through the generated extended examples and the actual calculation examples of enterprises. Experimental results demonstrate the feasibility and effectiveness of the proposed algorithm in solving such problems compared with the existing algorithms.

Key words: resource-constrained, single batch coupling, shuffled frog-leaping algorithm, makespan, energy consumption of machines

中图分类号:

TH186

唐红涛, 刘子豪, 官思佳. 资源受限下单批耦合混合流水车间调度问题研究[J]. 工业工程, 2023, 26(4): 114-123.

TANG Hongtao, LIU Zihao, GUAN Sijia. Scheduling Problem of Hybrid Flow Shops Considering Resource Constraints and Single Batch Coupling[J]. Industrial Engineering Journal, 2023, 26(4): 114-123.

参考文献

[1] 王凌, 周刚, 许烨, 等. 混合流水线调度研究进展[J]. 化工自动化及仪表, 2011, 38(1): 1-8
WANG Ling, ZHOU Gang, XU Ye, et al. Advances in the study on hybrid flow-shop scheduling[J]. Control and Instruments in Chemical Industry, 2011, 38(1): 1-8
[2] LI X, TANG H, YANG Z, et al. Integrated optimization approach of hybrid flow-shop scheduling based on process set[J]. IEEE Access, 2020, 8: 223782-223796
[3] LU C, GAO L, YI J, et al. Energy-efficient scheduling of distributed flow shop with heterogeneous factories: a real-world case from automobile industry in China[J]. IEEE Transactions on Industrial Informatics, 2021, 17(10): 6687-6696
[4] 李颖俐, 李新宇, 高亮. 混合流水车间调度问题研究综述[J]. 中国机械工程, 2020, 31(23): 2798-2813
LI Yingli, LI Xinyu, GAO Liang. Review on hybrid flow shop scheduling problems[J]. China Mechanical Engineering., 2020, 31(23): 2798-2813
[5] CHEN S, PAN Q K, GAO L. Production scheduling for blocking flowshop in distributed environment using effective heuristics and iterated greedy algorithm[J]. Robotics and Computer-Integrated Manufacturing, 2021, 71: 102155
[6] HOSSEINI S, SANA S S, ROSTAMI M. Assembly flow shop scheduling problem considering machine eligibility restrictions and auxiliary resource constraints[J]. International Journal of Systems Science-operations & Logistics, 2021, 9(4): 512-528
[7] TAO X, PAN Q, GAO L. An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem[J]. Computers & Industrial Engineering, 2022, 169: 108200
[8] COSTA A, FERNANDEZ-VIAGAS V, FRAMINAN J M. Solving the hybrid flow shop scheduling problem with limited human resource constraint[J]. Computers & Industrial Engineering, 2020, 146: 106545
[9] 唐红涛, 张缓. 基于绿色生产的混合流水车间调度问题研究[J]. 工业工程, 2022, 25(3): 115-123
TANG Hongtao, ZHANG Huan. A research on hybrid flow shop scheduling based on green production[J]. Industrial Engineering Journal, 2022, 25(3): 115-123
[10] 崔航浩, 张春江, 李新宇. 基于带随机网络的多种群粒子群优化算法求解多资源受限柔性作业车间调度问题[J]. 重庆大学学报, 2022, 45(4): 56-66
CUI Hanghao, ZHANG Chunjiang, LI Xinyu. A multi-population particle swarm optimization algorithm with random network for solving multi-resource constrained flexible job shop scheduling problems[J]. Journal of Chongqing University, 2022, 45(4): 56-66
[11] TAO X, LI J, HUANG T, et al. Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption[J]. Complex & Intelligent Systems, 2021, 7(1): 311-326
[12] ZHOU S, XING L, ZHENG X, et al. A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times[J]. IEEE Transactions on Cybernetics, 2021, 51(3): 1430-1442
[13] LI J, SONG M, WANG L, et al. Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs[J]. IEEE Transactions on Cybernetics, 2020, 50(6): 2425-2439
[14] EUSUFF M, LANSEY K, PASHA F. Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization[J]. Engineering Optimization, 2006, 38(2): 129-154
[15] CAI J, LEI D. A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time[J]. Complex & Intelligent Systems, 2021, 7(5): 2235-2253
[16] CAI J, LEI D, LI M. A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop[J]. International Journal of Production Research, 2021, 59(18): 5404-5421
[17] LIAO C J, TJANDRADJAJA E, CHUNG T P. An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem[J]. Applied Soft Computing, 2012, 12(6): 1755-1764
[18] PENG Z, ZHANG H, TANG H T, et al. Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect[J]. Journal of Intelligent Manufacturing, 2022, 33(6): 1725-1746
[19] QIN H, FAN P, TANG H, et al. An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint[J]. Computers & Industrial Engineering, 2019, 128: 458-476

资源受限下单批耦合混合流水车间调度问题研究

Scheduling Problem of Hybrid Flow Shops Considering Resource Constraints and Single Batch Coupling

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价

[1]	张国辉, 胡一凡, 孙靖贺. 改进遗传算法求解多时间约束的柔性作业车间调度问题[J]. 工业工程, 2020, 23(2): 19-25,48.
[2]	初梓豪, 徐哲, 李明, 顾坤. 随机多模式资源均衡问题建模与求解[J]. 工业工程, 2017, 20(3): 95-105.
[3]	何立华，马芳丽. 基于混沌差分进化粒子群算法的模糊资源受限项目调度问题[J]. 工业工程, 2016, 19(5): 39-44.
[4]	张连营1, 李彦伟1,2, 孙若昕1. 基于优先规则的模糊资源受限多项目调度[J]. 工业工程, 2014, 17(3): 13-17.
[5]	郭云涛，宋红艳，白思俊. 粒子群算法在具有迭代关系资源受限项目调度中的应用[J]. 工业工程, 2013, 16(5): 74-78.
[6]	谢阳，叶春明，陈君兰，周蓉. 基于混沌粒子群的资源受限项目调度问题[J]. 工业工程, 2012, 15(3): 57-61.