• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

考虑工厂合格性约束且具有序列相关准备时间的节能型分布式异构重入混合流水车间调度问题

Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints.

作者信息

Geng Kaifeng, Liu Li, Wu Zhanyong

机构信息

Fan Li Business School, Nanyang Institute of Technology, Nanyang, 473004, Henan, China.

School of Digital Media and Art Design, Nanyang Institute of Technology, Nanyang, 473004, Henan, China.

出版信息

Sci Rep. 2022 Nov 5;12(1):18741. doi: 10.1038/s41598-022-23144-6.

DOI:10.1038/s41598-022-23144-6
PMID:36335209
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9637128/
Abstract

In the face of energy crisis, manufacturers pay more and more attention to energy-saving scheduling. In the paper, we consider the distributed heterogeneous re-entrant hybrid flow shop scheduling problem (DHRHFSP) with sequence dependent setup times (DHRHFSP-SDST) considering factory eligibility constraints under time of use (TOU) price, which means that each job can only be assigned to its available set of factories and all factories have different number of machines and processing capacity, and so on. To deal with DHRHFSP-SDST, a multi-objective Artificial Bee Colony Algorithm (MOABC) is proposed to optimize both the makespan and total energy consumption. For the MOABC, firstly, a hybrid initialization method is presented to initialize the population; then, due to the electricity price shows significant differences vary from periods under TOU price, the energy saving operator based on right-shift strategy is proposed to avoid processing jobs with the high electricity price without affecting the productivity; thirdly, based on the full consideration of distributed heterogeneous and factory eligibility, crossover and mutation operators, three neighborhood search operators and new food sources generation strategy are designed; lastly, extensive experiments demonstrate the effectiveness of the proposed algorithm on solving the DHRHFSP-SDST.

摘要

面对能源危机,制造商越来越关注节能调度。在本文中,我们考虑了具有顺序相关设置时间的分布式异构重入混合流水车间调度问题(DHRHFSP),即DHRHFSP-SDST,该问题考虑了分时电价(TOU)下的工厂资格约束,这意味着每个作业只能分配到其可用的工厂集合中,并且所有工厂具有不同数量的机器和加工能力等。为了解决DHRHFSP-SDST,提出了一种多目标人工蜂群算法(MOABC)来同时优化完工时间和总能耗。对于MOABC,首先,提出了一种混合初始化方法来初始化种群;其次,由于分时电价下不同时段的电价差异显著,提出了基于右移策略的节能算子,以避免在不影响生产率的情况下处理高电价时段的作业;第三,在充分考虑分布式异构和工厂资格的基础上,设计了交叉和变异算子、三种邻域搜索算子以及新的食物源生成策略;最后,大量实验证明了所提算法在解决DHRHFSP-SDST问题上的有效性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/27dcd4730b92/41598_2022_23144_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/251ed462b119/41598_2022_23144_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/088d7913407a/41598_2022_23144_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/317579d1a82b/41598_2022_23144_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/9241fffee7f4/41598_2022_23144_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/18bd0446e710/41598_2022_23144_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/47eeb7cb3224/41598_2022_23144_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/68ebb07826e6/41598_2022_23144_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/d7cef3626441/41598_2022_23144_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/1e13214226c5/41598_2022_23144_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/ebbc4d9fd02c/41598_2022_23144_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/e343c17cce8b/41598_2022_23144_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/2f8ecdf1ec49/41598_2022_23144_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/52df1b239de5/41598_2022_23144_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/6e5cf710cda8/41598_2022_23144_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/27dcd4730b92/41598_2022_23144_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/251ed462b119/41598_2022_23144_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/088d7913407a/41598_2022_23144_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/317579d1a82b/41598_2022_23144_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/9241fffee7f4/41598_2022_23144_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/18bd0446e710/41598_2022_23144_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/47eeb7cb3224/41598_2022_23144_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/68ebb07826e6/41598_2022_23144_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/d7cef3626441/41598_2022_23144_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/1e13214226c5/41598_2022_23144_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/ebbc4d9fd02c/41598_2022_23144_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/e343c17cce8b/41598_2022_23144_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/2f8ecdf1ec49/41598_2022_23144_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/52df1b239de5/41598_2022_23144_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/6e5cf710cda8/41598_2022_23144_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1627/9637128/27dcd4730b92/41598_2022_23144_Fig15_HTML.jpg

相似文献

1
Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints.考虑工厂合格性约束且具有序列相关准备时间的节能型分布式异构重入混合流水车间调度问题
Sci Rep. 2022 Nov 5;12(1):18741. doi: 10.1038/s41598-022-23144-6.
2
Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times.具有序列相关设置时间的两阶段混合流水车间中多目标分布式调度的协作可变邻域搜索
Sci Rep. 2022 Sep 20;12(1):15724. doi: 10.1038/s41598-022-19215-3.
3
A Self-Learning Discrete Jaya Algorithm for Multiobjective Energy-Efficient Distributed No-Idle Flow-Shop Scheduling Problem in Heterogeneous Factory System.一种用于异构工厂系统中多目标节能分布式无空闲流水车间调度问题的自学习离散Jaya算法
IEEE Trans Cybern. 2022 Dec;52(12):12675-12686. doi: 10.1109/TCYB.2021.3086181. Epub 2022 Nov 18.
4
Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm.使用改进的 Jaya 算法解决带批量流的双目标分布式流水车间调度问题。
IEEE Trans Cybern. 2023 Jun;53(6):3818-3828. doi: 10.1109/TCYB.2022.3164165. Epub 2023 May 17.
5
An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints.一种改进的 Memetic 算法,用于解决具有运输和启停约束的节能分布式柔性作业车间调度问题。
Math Biosci Eng. 2023 Dec 5;20(12):21467-21498. doi: 10.3934/mbe.2023950.
6
Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.用于具有序列相关设置时间和学习效应的多目标单机分组调度问题的混合帕累托人工蜂群算法
Springerplus. 2016 Sep 17;5(1):1593. doi: 10.1186/s40064-016-3265-3. eCollection 2016.
7
An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints.一种用于解决具有多个时间约束的柔性作业车间调度问题的改进蚁群优化算法。
Math Biosci Eng. 2023 Feb 16;20(4):7519-7547. doi: 10.3934/mbe.2023325.
8
A Reinforcement-Learning-Based 3-D Estimation of Distribution Algorithm for Fuzzy Distributed Hybrid Flow-Shop Scheduling Considering On-Time-Delivery.一种基于强化学习的考虑准时交货的模糊分布式混合流水车间调度的三维分布估计算法
IEEE Trans Cybern. 2024 Feb;54(2):1024-1036. doi: 10.1109/TCYB.2023.3336656. Epub 2024 Jan 17.
9
Distributed Heterogeneous Co-Evolutionary Algorithm for Scheduling a Multistage Fine-Manufacturing System With Setup Constraints.用于调度具有设置约束的多阶段精细制造系统的分布式异构协同进化算法
IEEE Trans Cybern. 2024 Mar;54(3):1497-1510. doi: 10.1109/TCYB.2022.3217074. Epub 2024 Feb 9.
10
A Two-Stage Cooperative Evolutionary Algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem.一种具有特定问题知识的两阶段协同进化算法,用于无等待流水作业问题的节能调度。
IEEE Trans Cybern. 2021 Nov;51(11):5291-5303. doi: 10.1109/TCYB.2020.3025662. Epub 2021 Nov 9.

引用本文的文献

1
Research on sustainable collaborative scheduling problem of multi-stage mixed flow shop for crankshaft components.曲轴部件多阶段混合流水车间可持续协同调度问题研究
Sci Rep. 2024 Jan 2;14(1):209. doi: 10.1038/s41598-023-49519-x.

本文引用的文献

1
Memory-based variable neighborhood search for green vehicle routing problem with passing-by drivers: a comprehensive perspective.
Complex Intell Systems. 2022;8(3):2507-2525. doi: 10.1007/s40747-022-00661-5. Epub 2022 Feb 8.
2
A Self-Learning Discrete Jaya Algorithm for Multiobjective Energy-Efficient Distributed No-Idle Flow-Shop Scheduling Problem in Heterogeneous Factory System.一种用于异构工厂系统中多目标节能分布式无空闲流水车间调度问题的自学习离散Jaya算法
IEEE Trans Cybern. 2022 Dec;52(12):12675-12686. doi: 10.1109/TCYB.2021.3086181. Epub 2022 Nov 18.