Advanced constraint programming formulations for additive manufacturing machine scheduling problems

In comparison with traditional subtractive manufacturing techniques, additive manufacturing (AM) enables fabricating complex parts through a layer-by-layer process. AM makes it possible to produce one-piece and lightweight functional products, which are traditionally made from several parts. This paper introduces constraint programming (CP) models to minimise makespan in single, parallel identical and parallel unrelated AM machine scheduling environments for selective laser melting. Alternative CP formulations are explored to improve efficiency. The proposed CP model significantly benefits from the introduction of interval variables to replace binary assignment variables, and pre-definitions to narrow the search space, resulting in increased search performance. A computational study has been conducted to compare the performance of our proposed CP model with both a mixed-integer programming and a genetic algorithm from existing literature, evaluating improvements made to its search capability. Computational results indicate that the proposed CP model can obtain high-quality solutions in a timely manner even for several large-size instances.

搜集汇总

背景与挑战

背景概述

该数据集聚焦于增材制造（AM）中的机器调度问题，特别是针对选择性激光熔化技术，提出了高级约束编程（CP）模型以最小化制造时间。数据集包含相关测试数据和文档，支持比较CP模型与混合整数规划、遗传算法的性能，旨在为AM调度提供高效解决方案。