Effective job reassignments in large scale collaborative additive manufacturing networks

IF 10 1区 工程技术 Q1 ENGINEERING, INDUSTRIAL
Dominik Zehetner, Margaretha Gansterer
{"title":"Effective job reassignments in large scale collaborative additive manufacturing networks","authors":"Dominik Zehetner,&nbsp;Margaretha Gansterer","doi":"10.1016/j.ijpe.2025.109731","DOIUrl":null,"url":null,"abstract":"<div><div>The growth of large-scale collaborative additive manufacturing (AM) networks necessitates scalable, efficient, and privacy-preserving solutions for decentralized production planning. This study investigates the integration of machine learning (ML) into combinatorial reverse auction frameworks to support cost-efficient job reassignments across distributed AM systems. We benchmark several supervised ML models trained on optimal solutions to a single-machine AM scheduling problem and identify robust, regularised linear regression models as the best-performing predictors. Our best model achieves a mean absolute percentage error of approximately 3%, allowing for rapid and reliable cost predictions. Our experiments further demonstrate that linear regression models can outperform more complex alternatives such as neural networks and decision tree ensembles in both accuracy and robustness. The ML-enhanced framework significantly reduces computational overhead and limits the exposure of sensitive production data, outperforming traditional approaches like mixed-integer linear programming and Adaptive Large Neighborhood Search. When integrated into a decentralised auction mechanism, the model enables efficient task reallocation and system-wide cost reductions. While occasional violations of individual rationality due to cost underestimation present a drawback compared to benchmark methods, we argue that long-term efficiency gains may offset these effects in repeated interactions. Overall, this work highlights the potential of lightweight ML models to enable scalable, adaptive, and privacy-aware coordination in decentralised AM networks.</div></div>","PeriodicalId":14287,"journal":{"name":"International Journal of Production Economics","volume":"289 ","pages":"Article 109731"},"PeriodicalIF":10.0000,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Production Economics","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925527325002166","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

The growth of large-scale collaborative additive manufacturing (AM) networks necessitates scalable, efficient, and privacy-preserving solutions for decentralized production planning. This study investigates the integration of machine learning (ML) into combinatorial reverse auction frameworks to support cost-efficient job reassignments across distributed AM systems. We benchmark several supervised ML models trained on optimal solutions to a single-machine AM scheduling problem and identify robust, regularised linear regression models as the best-performing predictors. Our best model achieves a mean absolute percentage error of approximately 3%, allowing for rapid and reliable cost predictions. Our experiments further demonstrate that linear regression models can outperform more complex alternatives such as neural networks and decision tree ensembles in both accuracy and robustness. The ML-enhanced framework significantly reduces computational overhead and limits the exposure of sensitive production data, outperforming traditional approaches like mixed-integer linear programming and Adaptive Large Neighborhood Search. When integrated into a decentralised auction mechanism, the model enables efficient task reallocation and system-wide cost reductions. While occasional violations of individual rationality due to cost underestimation present a drawback compared to benchmark methods, we argue that long-term efficiency gains may offset these effects in repeated interactions. Overall, this work highlights the potential of lightweight ML models to enable scalable, adaptive, and privacy-aware coordination in decentralised AM networks.
大规模协同增材制造网络中的有效工作再分配
大规模协同增材制造(AM)网络的发展需要可扩展、高效和隐私保护的解决方案,以实现分散的生产计划。本研究探讨了将机器学习(ML)集成到组合反向拍卖框架中,以支持跨分布式AM系统的经济高效的工作重新分配。我们对几个有监督的机器学习模型进行了基准测试,这些模型是针对单机AM调度问题的最优解决方案进行训练的,并确定了鲁棒的、正则化的线性回归模型作为最佳预测指标。我们的最佳模型实现了大约3%的平均绝对百分比误差,允许快速可靠的成本预测。我们的实验进一步证明,线性回归模型在准确性和鲁棒性方面都优于更复杂的替代方案,如神经网络和决策树集成。机器学习增强的框架显著降低了计算开销,限制了敏感生产数据的暴露,优于混合整数线性规划和自适应大邻域搜索等传统方法。当集成到分散的拍卖机制中时,该模型能够有效地重新分配任务并降低系统范围内的成本。虽然与基准方法相比,由于成本低估而偶尔违反个人理性是一个缺点,但我们认为,长期效率的提高可能会在重复的相互作用中抵消这些影响。总的来说,这项工作突出了轻量级ML模型的潜力,可以在分散的AM网络中实现可扩展、自适应和隐私感知的协调。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Production Economics
International Journal of Production Economics 管理科学-工程:工业
CiteScore
21.40
自引率
7.50%
发文量
266
审稿时长
52 days
期刊介绍: The International Journal of Production Economics focuses on the interface between engineering and management. It covers all aspects of manufacturing and process industries, as well as production in general. The journal is interdisciplinary, considering activities throughout the product life cycle and material flow cycle. It aims to disseminate knowledge for improving industrial practice and strengthening the theoretical base for decision making. The journal serves as a forum for exchanging ideas and presenting new developments in theory and application, combining academic standards with practical value for industrial applications.
×
引用
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学术官方微信