Heterogeneous Material Order Job Scheduling Problem in Additive Manufacturing

DOI

10.2991/978-94-6463-488-4_49How to use a DOI?

Keywords

Additive manufacturing; Production planning; Scheduling; Particle swarm optimization

Abstract

To enhance the efficiency of additive manufacturing production, this paper establishes a Mixed Integer Linear Programming (MILP) model with the objective of minimizing the maximum completion time in an equivalent parallel additive manufacturing machine environment. The problem is tackled using a particle swarm algorithm, and the results are compared with those obtained from a solver to validate the superiority of the algorithm.

Copyright

© 2024 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Jingwen Guan
AU  - Xiuli Wang
PY  - 2024
DA  - 2024/08/29
TI  - Heterogeneous Material Order Job Scheduling Problem in Additive Manufacturing
BT  - Proceedings of the 2024 2nd International Conference on Digital Economy and Management Science (CDEMS 2024)
PB  - Atlantis Press
SP  - 437
EP  - 443
SN  - 2352-5428
UR  - https://doi.org/10.2991/978-94-6463-488-4_49
DO  - 10.2991/978-94-6463-488-4_49
ID  - Guan2024
ER  -