Nesting and scheduling for parallel additive manufacturing machines with uncertain processing times: a simulation-optimisation approach

被引:0
作者
Wu, Hao [1 ]
Yu, Chunlong [1 ]
Yu, Shaohua [2 ]
机构
[1] Tongji Univ, Sch Mech Engn, Caoan Rd 4800, Shanghai 201804, Peoples R China
[2] Nanjing Univ Sci & Technol, Sch Intelligent Mfg, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
Additive manufacturing; parallel machine scheduling; nesting and scheduling; stochastic scheduling; simulation optimisation; adaptive large neighbourhood search; MINIMIZE MAKESPAN; BIN PACKING; MODELS; ALGORITHM;
D O I
10.1080/00207543.2025.2513575
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Additive manufacturing (AM) plays a crucial role in meeting the growing demand for mass customisation, where on-time delivery is critical. While most existing AM scheduling studies address deterministic scenarios, the impact of processing time uncertainties on on-time delivery remains less explored. To bridge this gap, we investigate the nesting and scheduling problem for parallel AM machines with uncertain processing times, focussing on selective laser melting technologies. The objective is to minimise the expected number of tardy parts. We formulate a mixed-integer programming model for the deterministic case. To effectively handle processing time uncertainties, we propose a simulation-optimisation approach that combines Monte Carlo simulation with an adaptive large neighbourhood search method. Experimental results demonstrate the benefits of accounting for these uncertainties in reducing delivery delays. Additionally, we analyze the factors influencing these benefits and the underlying drivers of solution robustness.
引用
收藏
页数:30
相关论文
共 63 条
[1]   Simheuristic algorithm for a stochastic parallel machine scheduling problem with periodic re-planning assessment [J].
Abu-Marrul, Victor ;
Martinelli, Rafael ;
Hamacher, Silvio ;
Gribkovskaia, Irina .
ANNALS OF OPERATIONS RESEARCH, 2023, 320 (02) :547-572
[2]   A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems [J].
Alicastro, Mirko ;
Ferone, Daniele ;
Festa, Paola ;
Fugaro, Serena ;
Pastore, Tommaso .
COMPUTERS & OPERATIONS RESEARCH, 2021, 131
[3]   A heuristic approach for a scheduling problem in additive manufacturing under technological constraints [J].
Aloui, Aymen ;
Hadj-Hamou, Khaled .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 154
[4]   A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing [J].
Altekin, F. Tevhide ;
Bukchin, Yossi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 301 (01) :235-253
[5]   An experimental analysis of deepest bottom-left-fill packing methods for additive manufacturing [J].
Araujo, Luiz J. P. ;
Panesar, Ajit ;
Ozcan, Ender ;
Atkin, Jason ;
Baumers, Martin ;
Ashcroft, Ian .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, 58 (22) :6917-6933
[6]  
Bai L., 2023, 2023 IEEE 19 INT C A, P1
[7]   Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation [J].
Balin, Savas .
INFORMATION SCIENCES, 2011, 181 (17) :3551-3569
[8]   A new placement heuristic for the orthogonal stock-cutting problem [J].
Burke, EK ;
Kendall, G ;
Whitwell, G .
OPERATIONS RESEARCH, 2004, 52 (04) :655-671
[9]   Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing [J].
Che, Yuxin ;
Hu, Kanxin ;
Zhang, Zhenzhen ;
Lim, Andrew .
COMPUTERS & OPERATIONS RESEARCH, 2021, 130
[10]   Production scheduling and nesting in additive manufacturing [J].
Chergui, Akram ;
Hadj-Hamou, Khaled ;
Vignat, Frederic .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 126 :292-301