具有不平等和一致子批次的节能型三阶段再制造系统调度问题中的批次流问题

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Wenjie Wang , Gang Yuan , Duc Truong Pham , Honghao Zhang , Dekun Wang , Guangdong Tian
{"title":"具有不平等和一致子批次的节能型三阶段再制造系统调度问题中的批次流问题","authors":"Wenjie Wang ,&nbsp;Gang Yuan ,&nbsp;Duc Truong Pham ,&nbsp;Honghao Zhang ,&nbsp;Dekun Wang ,&nbsp;Guangdong Tian","doi":"10.1016/j.compeleceng.2024.109813","DOIUrl":null,"url":null,"abstract":"<div><div>The well-accepted three-stage remanufacturing system scheduling aims to achieve intelligent and green remanufacturing by reasonably coordinating limited resources in the system involving disassembly, reprocessing, reassembly production stages. Currently, the lot-streaming production mode is increasingly favoured by scholars and enterprise managers due to its remarkable performance in reducing machines’ idle time and improving production efficiency. This paper investigates an energy-efficient scheduling issue for three-stage remanufacturing systems under the lot-streaming environment where each large-sized lot is split into its constituent small-sized sublots whose sizes may be inequal but remain consistent among various operations. Foremost, a dual-objective optimization mathematical model aiming at concurrently minimizing the makespan and total energy consumption is built. Then, since its NP-hard property, an improved fruit fly optimization (IFFO) algorithm is accordingly introduced. IFFO adopts a problem-specific three-layer encoding mechanism that contains three key pieces of scheduling information, i.e., lot sequence, machine assignment, and lot size splitting. Besides, based on the lot-streaming property, two distinct decoding strategies, i.e., sublot preemption and lot preemption are also correspondingly integrated. In addition, several effective optimization techniques, such as the simulated annealing-based replacement mechanism and Sigma method, are also employed to seek high-quality Pareto solutions. A real case and several designed random small/large-sized instances are tested on IFFO and its peers under three performance indicators. To obtain a convincing and solid conclusion, the Wilcoxon signed-rank statistical test is executed as well. The overall experimental results show that IFFO is feasible and effective in addressing the studied problem.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"120 ","pages":"Article 109813"},"PeriodicalIF":4.0000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lot-streaming in energy-efficient three-stage remanufacturing system scheduling problem with inequal and consistent sublots\",\"authors\":\"Wenjie Wang ,&nbsp;Gang Yuan ,&nbsp;Duc Truong Pham ,&nbsp;Honghao Zhang ,&nbsp;Dekun Wang ,&nbsp;Guangdong Tian\",\"doi\":\"10.1016/j.compeleceng.2024.109813\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The well-accepted three-stage remanufacturing system scheduling aims to achieve intelligent and green remanufacturing by reasonably coordinating limited resources in the system involving disassembly, reprocessing, reassembly production stages. Currently, the lot-streaming production mode is increasingly favoured by scholars and enterprise managers due to its remarkable performance in reducing machines’ idle time and improving production efficiency. This paper investigates an energy-efficient scheduling issue for three-stage remanufacturing systems under the lot-streaming environment where each large-sized lot is split into its constituent small-sized sublots whose sizes may be inequal but remain consistent among various operations. Foremost, a dual-objective optimization mathematical model aiming at concurrently minimizing the makespan and total energy consumption is built. Then, since its NP-hard property, an improved fruit fly optimization (IFFO) algorithm is accordingly introduced. IFFO adopts a problem-specific three-layer encoding mechanism that contains three key pieces of scheduling information, i.e., lot sequence, machine assignment, and lot size splitting. Besides, based on the lot-streaming property, two distinct decoding strategies, i.e., sublot preemption and lot preemption are also correspondingly integrated. In addition, several effective optimization techniques, such as the simulated annealing-based replacement mechanism and Sigma method, are also employed to seek high-quality Pareto solutions. A real case and several designed random small/large-sized instances are tested on IFFO and its peers under three performance indicators. To obtain a convincing and solid conclusion, the Wilcoxon signed-rank statistical test is executed as well. The overall experimental results show that IFFO is feasible and effective in addressing the studied problem.</div></div>\",\"PeriodicalId\":50630,\"journal\":{\"name\":\"Computers & Electrical Engineering\",\"volume\":\"120 \",\"pages\":\"Article 109813\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Electrical Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0045790624007407\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790624007407","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

已被广泛接受的三阶段再制造系统调度旨在通过合理协调系统中涉及拆卸、再加工、再组装生产阶段的有限资源,实现智能化绿色再制造。目前,批量流水线生产模式因其在减少机器闲置时间、提高生产效率方面的显著表现,越来越受到学者和企业管理者的青睐。本文研究了批量流环境下三阶段再制造系统的节能调度问题,在这种环境下,每个大尺寸批量被分割成其组成的小尺寸子批量,这些子批量的尺寸可能不相等,但在各种操作中保持一致。首先,我们建立了一个双目标优化数学模型,旨在同时最小化生产周期和总能耗。然后,由于其 NP-hard(NP-hard)特性,相应地引入了改进的果蝇优化(IFFO)算法。IFFO 采用了针对具体问题的三层编码机制,其中包含三个关键的调度信息,即批次序列、机器分配和批次大小分割。此外,基于批次流特性,还相应地集成了两种不同的解码策略,即子批次抢占和批次抢占。此外,还采用了几种有效的优化技术,如基于模拟退火的替换机制和西格玛方法,以寻求高质量的帕累托解决方案。在三个性能指标下,对 IFFO 及其同行的一个真实案例和几个设计的随机小/大尺寸实例进行了测试。为了得出令人信服的可靠结论,还进行了 Wilcoxon 符号秩统计检验。总体实验结果表明,IFFO 在解决所研究的问题方面是可行且有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lot-streaming in energy-efficient three-stage remanufacturing system scheduling problem with inequal and consistent sublots
The well-accepted three-stage remanufacturing system scheduling aims to achieve intelligent and green remanufacturing by reasonably coordinating limited resources in the system involving disassembly, reprocessing, reassembly production stages. Currently, the lot-streaming production mode is increasingly favoured by scholars and enterprise managers due to its remarkable performance in reducing machines’ idle time and improving production efficiency. This paper investigates an energy-efficient scheduling issue for three-stage remanufacturing systems under the lot-streaming environment where each large-sized lot is split into its constituent small-sized sublots whose sizes may be inequal but remain consistent among various operations. Foremost, a dual-objective optimization mathematical model aiming at concurrently minimizing the makespan and total energy consumption is built. Then, since its NP-hard property, an improved fruit fly optimization (IFFO) algorithm is accordingly introduced. IFFO adopts a problem-specific three-layer encoding mechanism that contains three key pieces of scheduling information, i.e., lot sequence, machine assignment, and lot size splitting. Besides, based on the lot-streaming property, two distinct decoding strategies, i.e., sublot preemption and lot preemption are also correspondingly integrated. In addition, several effective optimization techniques, such as the simulated annealing-based replacement mechanism and Sigma method, are also employed to seek high-quality Pareto solutions. A real case and several designed random small/large-sized instances are tested on IFFO and its peers under three performance indicators. To obtain a convincing and solid conclusion, the Wilcoxon signed-rank statistical test is executed as well. The overall experimental results show that IFFO is feasible and effective in addressing the studied problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信