基于 NSGAII 的批量流灵活作业车间问题的作业分配调度算法(带可变子块

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-10-10 DOI:10.1016/j.cor.2024.106866
Shuai Shao , Gaochao Xu , Jiaxing Li , Ziqi Liu , Zhenjun Jin
{"title":"基于 NSGAII 的批量流灵活作业车间问题的作业分配调度算法(带可变子块","authors":"Shuai Shao ,&nbsp;Gaochao Xu ,&nbsp;Jiaxing Li ,&nbsp;Ziqi Liu ,&nbsp;Zhenjun Jin","doi":"10.1016/j.cor.2024.106866","DOIUrl":null,"url":null,"abstract":"<div><div>The flexible job shop scheduling problem has gained lots of attention from scholars because of its high flexibility. The lot-streaming scheduling strategy with its advantages of high resource utilization and reduced response time has gradually become an important solution to the flexible job shop scheduling problem at this stage, but it assumes that the number of available processing equipment is not limited. However, the number of equipment that can be processed in parallel for a single process in the actual production of small and medium-sized enterprises is limited. To address the issue, a multi-objective optimal scheduling method for variable sublots flexible shops involving switching time and switching operator restrictions is proposed in this paper, which can be described as based on the principle of job balancing the rational selection of the number of machines and jobs allocation (JBJA) to maximize the machine utilization while minimizing the total processing time. In this paper, we propose adaptive job scheduling NSGAII (AJS-NSGAII) which contains a hidden type encoding, a decoding method using JBJA strategy, and a hybrid rule to initialize the population and solve 15 orders. The experimental findings verify that this algorithm is capable of ensuring the actual production requirements of the enterprise, its multi-machine selection rules are effective and its overall performance is superior.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106866"},"PeriodicalIF":4.1000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A job assignment scheduling algorithm with variable sublots for lot-streaming flexible job shop problem based on NSGAII\",\"authors\":\"Shuai Shao ,&nbsp;Gaochao Xu ,&nbsp;Jiaxing Li ,&nbsp;Ziqi Liu ,&nbsp;Zhenjun Jin\",\"doi\":\"10.1016/j.cor.2024.106866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The flexible job shop scheduling problem has gained lots of attention from scholars because of its high flexibility. The lot-streaming scheduling strategy with its advantages of high resource utilization and reduced response time has gradually become an important solution to the flexible job shop scheduling problem at this stage, but it assumes that the number of available processing equipment is not limited. However, the number of equipment that can be processed in parallel for a single process in the actual production of small and medium-sized enterprises is limited. To address the issue, a multi-objective optimal scheduling method for variable sublots flexible shops involving switching time and switching operator restrictions is proposed in this paper, which can be described as based on the principle of job balancing the rational selection of the number of machines and jobs allocation (JBJA) to maximize the machine utilization while minimizing the total processing time. In this paper, we propose adaptive job scheduling NSGAII (AJS-NSGAII) which contains a hidden type encoding, a decoding method using JBJA strategy, and a hybrid rule to initialize the population and solve 15 orders. The experimental findings verify that this algorithm is capable of ensuring the actual production requirements of the enterprise, its multi-machine selection rules are effective and its overall performance is superior.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"173 \",\"pages\":\"Article 106866\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824003381\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003381","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

柔性作业车间调度问题因其高度的灵活性而受到学者们的广泛关注。批量流水排程策略以其资源利用率高、响应时间短等优点逐渐成为现阶段柔性作业车间排程问题的重要解决方案,但其前提是可用加工设备的数量不受限制。然而,在中小企业的实际生产中,单个工序可并行处理的设备数量是有限的。针对这一问题,本文提出了一种涉及切换时间和切换操作员限制的可变子批量柔性车间多目标优化排程方法,该方法可以说是基于作业平衡原则合理选择机器数量和作业分配(JBJA),在最大限度提高机器利用率的同时,最小化总加工时间。在本文中,我们提出了自适应作业调度 NSGAII(AJS-NSGAII),它包含隐藏类型编码、使用 JBJA 策略的解码方法以及初始化种群和求解 15 个订单的混合规则。实验结果验证了该算法能够保证企业的实际生产需求,其多机选择规则有效,整体性能优越。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A job assignment scheduling algorithm with variable sublots for lot-streaming flexible job shop problem based on NSGAII
The flexible job shop scheduling problem has gained lots of attention from scholars because of its high flexibility. The lot-streaming scheduling strategy with its advantages of high resource utilization and reduced response time has gradually become an important solution to the flexible job shop scheduling problem at this stage, but it assumes that the number of available processing equipment is not limited. However, the number of equipment that can be processed in parallel for a single process in the actual production of small and medium-sized enterprises is limited. To address the issue, a multi-objective optimal scheduling method for variable sublots flexible shops involving switching time and switching operator restrictions is proposed in this paper, which can be described as based on the principle of job balancing the rational selection of the number of machines and jobs allocation (JBJA) to maximize the machine utilization while minimizing the total processing time. In this paper, we propose adaptive job scheduling NSGAII (AJS-NSGAII) which contains a hidden type encoding, a decoding method using JBJA strategy, and a hybrid rule to initialize the population and solve 15 orders. The experimental findings verify that this algorithm is capable of ensuring the actual production requirements of the enterprise, its multi-machine selection rules are effective and its overall performance is superior.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Editorial Board A literature review of reinforcement learning methods applied to job-shop scheduling problems An accelerated Benders decomposition method for distributionally robust sustainable medical waste location and transportation problem Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria Portfolio optimisation: Bridging the gap between theory and practice
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1