A Novel Arc-Flow-Graph-Based Modeling and Optimization Method for Parallel-Machine Parallel-Batch Scheduling Problems with Non-Identical Release Time and Product Specifications

Zhiang Liu, Chang-Ling Chen, Ziyan Zhao, Shixin Liu
{"title":"A Novel Arc-Flow-Graph-Based Modeling and Optimization Method for Parallel-Machine Parallel-Batch Scheduling Problems with Non-Identical Release Time and Product Specifications","authors":"Zhiang Liu, Chang-Ling Chen, Ziyan Zhao, Shixin Liu","doi":"10.1109/ICCSI55536.2022.9970691","DOIUrl":null,"url":null,"abstract":"Batch processing machine scheduling problems (BPMSP) are an important branch of production scheduling problems and are widely used in many industries including semiconductor manufacturing and metal processing, etc. In this paper, we propose a novel pattern transfer graph and an arc flow graph for a parallel-batch processing problem of jobs with non-identical release time and specifications on parallel machine scenarios with capacity limits. They are used to describe the process of job transfer between batches and the arrangement within batches. Based on them, a novel mixed linear integer programming model is formulated. Unlike the general models, the scale of the formulation is independent of the number of jobs but only related to the number of different kinds of processing time, release time, and specifications of jobs. We compare our model with the state-of-the-art model and demonstrate its significant advantage in solving large-scale instances. In addition, its performance is also tested on a practical problem of nonferrous metal processing to show its great industrial application potential.","PeriodicalId":421514,"journal":{"name":"2022 International Conference on Cyber-Physical Social Intelligence (ICCSI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Cyber-Physical Social Intelligence (ICCSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSI55536.2022.9970691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Batch processing machine scheduling problems (BPMSP) are an important branch of production scheduling problems and are widely used in many industries including semiconductor manufacturing and metal processing, etc. In this paper, we propose a novel pattern transfer graph and an arc flow graph for a parallel-batch processing problem of jobs with non-identical release time and specifications on parallel machine scenarios with capacity limits. They are used to describe the process of job transfer between batches and the arrangement within batches. Based on them, a novel mixed linear integer programming model is formulated. Unlike the general models, the scale of the formulation is independent of the number of jobs but only related to the number of different kinds of processing time, release time, and specifications of jobs. We compare our model with the state-of-the-art model and demonstrate its significant advantage in solving large-scale instances. In addition, its performance is also tested on a practical problem of nonferrous metal processing to show its great industrial application potential.
一种新的基于圆弧流图的放行时间和产品规格不相同的并行-机器并行-批调度问题建模与优化方法
批量加工机器调度问题是生产调度问题的一个重要分支,广泛应用于半导体制造、金属加工等行业。本文针对具有容量限制的并行机场景下具有不同放行时间和规格的并行批处理问题,提出了一种新的模式转移图和圆弧流图。它们用来描述作业在批之间的传递过程和批内的安排。在此基础上,提出了一种新的混合线性整数规划模型。与一般模型不同的是,该模型的编制规模与作业数量无关,而只与不同种类作业的加工时间、放行时间和作业规格有关。我们将我们的模型与最先进的模型进行了比较,并证明了它在解决大规模实例方面的显着优势。此外,还在有色金属加工的实际问题上对其性能进行了测试,显示了其巨大的工业应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信