• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于启发式的自适应迭代贪婪算法求解一致且混合子批的批量流混合流水车间调度问题。

A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots.

机构信息

Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China.

Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China.

出版信息

Sensors (Basel). 2023 Mar 3;23(5):2808. doi: 10.3390/s23052808.

DOI:10.3390/s23052808
PMID:36905012
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10007029/
Abstract

Owing to the different quantities and processing times of sub-lots, intermingling sub-lots with each other, instead of fixing the production sequence of sub-lots of a lot as in the existing studies, is a more practical approach to lot-streaming flow shops. Hence, a lot-streaming hybrid flow shop scheduling problem with consistent and intermingled sub-lots (LHFSP-CIS) was studied. A mixed integer linear programming (MILP) model was established, and a heuristic-based adaptive iterated greedy algorithm (HAIG) with three modifications was designed to solve the problem. Specifically, a two-layer encoding method was proposed to decouple the sub-lot-based connection. Two heuristics were embedded in the decoding process to reduce the manufacturing cycle. Based on this, a heuristic-based initialization is proposed to improve the performance of the initial solution; an adaptive local search with four specific neighborhoods and an adaptive strategy has been structured to improve the exploration and exploitation ability. Besides, an acceptance criterion of inferior solutions has been improved to promote global optimization ability. The experiment and the non-parametric Kruskal-Wallis test ( = 0) showed the significant advantages of HAIG in effectiveness and robustness compared with five state-of-the-art algorithms. An industrial case study verifies that intermingling sub-lots is an effective technique to enhance the utilization ratio of machines and shorten the manufacturing cycle.

摘要

由于子批的数量和处理时间不同,与现有研究中将子批的生产顺序固定不同,将子批相互混合是实现批量流车间的更实用方法。因此,研究了具有一致和混合子批的批量混合流水车间调度问题(LHFSP-CIS)。建立了混合整数线性规划(MILP)模型,并设计了一种基于启发式的自适应迭代贪婪算法(HAIG),其中包含三项改进。具体来说,提出了一种两层编码方法来解耦基于子批的连接。在解码过程中嵌入了两种启发式算法来减少制造周期。在此基础上,提出了基于启发式的初始化方法来改善初始解的性能;构建了具有四个特定邻域和自适应策略的自适应局部搜索,以提高探索和开发能力。此外,改进了劣解的接受标准以提高全局优化能力。实验和非参数克鲁斯卡尔-沃利斯检验( = 0)表明,与五种最先进的算法相比,HAIG 在有效性和鲁棒性方面具有显著优势。一个工业案例研究验证了混合子批是提高机器利用率和缩短制造周期的有效技术。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/2f0df5c4952b/sensors-23-02808-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/4e3050038e89/sensors-23-02808-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/dc04fe1aa663/sensors-23-02808-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/a45b38f6050c/sensors-23-02808-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/6d970e78f5d5/sensors-23-02808-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/f211c75b5404/sensors-23-02808-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/63feb2b8e5fd/sensors-23-02808-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/12b496a9490a/sensors-23-02808-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/5f6afd3dab6b/sensors-23-02808-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/2f0df5c4952b/sensors-23-02808-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/4e3050038e89/sensors-23-02808-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/dc04fe1aa663/sensors-23-02808-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/a45b38f6050c/sensors-23-02808-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/6d970e78f5d5/sensors-23-02808-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/f211c75b5404/sensors-23-02808-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/63feb2b8e5fd/sensors-23-02808-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/12b496a9490a/sensors-23-02808-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/5f6afd3dab6b/sensors-23-02808-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/370c/10007029/2f0df5c4952b/sensors-23-02808-g009.jpg

相似文献

1
A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots.基于启发式的自适应迭代贪婪算法求解一致且混合子批的批量流混合流水车间调度问题。
Sensors (Basel). 2023 Mar 3;23(5):2808. doi: 10.3390/s23052808.
2
Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns.具有机器故障的进化多目标阻塞批处理流水车间调度。
IEEE Trans Cybern. 2019 Jan;49(1):184-197. doi: 10.1109/TCYB.2017.2771213. Epub 2017 Nov 17.
3
Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.基于常数加工时间的缓冲两机排列流水车间问题的迭代局部搜索及其它算法。
Evol Comput. 2021 Sep 1;29(3):415-439. doi: 10.1162/evco_a_00287.
4
A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem.一种使用两种解决方案表示的混合进化算法在混合流水作业调度问题中的应用。
IEEE Trans Cybern. 2023 Mar;53(3):1752-1764. doi: 10.1109/TCYB.2021.3120875. Epub 2023 Feb 15.
5
Research of Flexible Assembly Job-Shop Batch-Scheduling Problem Based on Improved Artificial Bee Colony.基于改进人工蜂群算法的柔性装配作业车间批量调度问题研究
Front Bioeng Biotechnol. 2022 Aug 16;10:909548. doi: 10.3389/fbioe.2022.909548. eCollection 2022.
6
Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times.具有顺序相关设置时间的无关并行机调度的共生生物体搜索算法。
PLoS One. 2018 Jul 5;13(7):e0200030. doi: 10.1371/journal.pone.0200030. eCollection 2018.
7
Two hybrid flow shop scheduling lines with assembly stage and compatibility constraints.两条具有装配阶段和兼容性约束的混合流水作业调度线。
PLoS One. 2024 Jun 21;19(6):e0304119. doi: 10.1371/journal.pone.0304119. eCollection 2024.
8
Hybrid Residual Multiexpert Reinforcement Learning for Spatial Scheduling of High-Density Parking Lots.用于高密度停车场空间调度的混合残差多专家强化学习
IEEE Trans Cybern. 2024 May;54(5):2771-2783. doi: 10.1109/TCYB.2023.3312647. Epub 2024 Apr 16.
9
An effective PSO-based memetic algorithm for flow shop scheduling.一种基于粒子群优化的混合算法用于流水车间调度
IEEE Trans Syst Man Cybern B Cybern. 2007 Feb;37(1):18-27. doi: 10.1109/tsmcb.2006.883272.
10
Virtual Simulation-Based Optimization for Assembly Flow Shop Scheduling Using Migratory Bird Algorithm.基于虚拟仿真的候鸟算法在装配流水车间调度中的优化
Biomimetics (Basel). 2024 Sep 21;9(9):571. doi: 10.3390/biomimetics9090571.