增材制造单机调度的分支价格算法

IF 5.4 2区 管理学 Q1 BUSINESS, FINANCE Journal of Management Science and Engineering Pub Date : 2023-06-01 DOI:10.1016/j.jmse.2022.10.001
Lindong Liu, Zhenyu Wu, Yugang Yu
{"title":"增材制造单机调度的分支价格算法","authors":"Lindong Liu,&nbsp;Zhenyu Wu,&nbsp;Yugang Yu","doi":"10.1016/j.jmse.2022.10.001","DOIUrl":null,"url":null,"abstract":"<div><p>Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&amp;P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&amp;P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</p></div>","PeriodicalId":36172,"journal":{"name":"Journal of Management Science and Engineering","volume":null,"pages":null},"PeriodicalIF":5.4000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing\",\"authors\":\"Lindong Liu,&nbsp;Zhenyu Wu,&nbsp;Yugang Yu\",\"doi\":\"10.1016/j.jmse.2022.10.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&amp;P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&amp;P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</p></div>\",\"PeriodicalId\":36172,\"journal\":{\"name\":\"Journal of Management Science and Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.4000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Management Science and Engineering\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S209623202200052X\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Management Science and Engineering","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S209623202200052X","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0

摘要

近年来,增材制造(AM)因其广泛的应用和不断增长的需求而引起了人们的广泛关注。增材制造具有生产灵活性和设计自由度的优点。在本研究中,我们考虑了在增材制造行业中出现的批量加工机(BPM)调度问题的一个实际变体,其中一台增材制造机器可以同时加工多个零件,只要不违反二维矩形包装约束。基于我们的混合整数规划(MIP)模型的集划分公式,通过将列生成技术嵌入到分支定界框架中,开发了分支和价格(B&P)算法。此外,开发了一种新的标记算法来加速列生成过程。我们的研究是第一个提供B&P算法来解决增材制造行业的BPM调度问题。我们使用现代MIP求解器(Gurobi)和3D打印工厂的真实数据测试了算法的性能。结果表明,对于测试的大多数实例,我们的算法产生的结果与Gurobi相似或相同,计算时间合理,并且在一些大型实例上的解决方案质量和运行时间方面优于Gurobi。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Management Science and Engineering
Journal of Management Science and Engineering Engineering-Engineering (miscellaneous)
CiteScore
9.30
自引率
3.00%
发文量
37
审稿时长
108 days
期刊介绍: The Journal of Engineering and Applied Science (JEAS) is the official journal of the Faculty of Engineering, Cairo University (CUFE), Egypt, established in 1816. The Journal of Engineering and Applied Science publishes fundamental and applied research articles and reviews spanning different areas of engineering disciplines, applications, and interdisciplinary topics.
期刊最新文献
Welfare Analysis with Uncertain Market Segment Proportions Can Smart Transportation Reduce Carbon Emission Intensity? - An Empirical Study from Macro and Micro Perspectives in China Mobile Telecommunication Companies’ Investment and Pricing Strategies for Content Service Should Competing Sellers Adopt the Data Analytics Service to Enable Product Improvement in Online Marketplace Portfolio optimization based on network centralities: Which centrality is better for asset selection during global crises?
×
引用
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