An iterated local search for customer order scheduling in additive manufacturing

Research output: Contribution to journalResearch articleContributedpeer-review


This paper studies the customer order scheduling problem in the context of additive manufacturing. The study discusses an integrated problem involving the nesting of parts as well as the scheduling of batches of nested parts onto unrelated parallel machines. A mixed-integer programming model is presented, based on existing formulations from the literature, that integrates different materials and sequence-dependent setup times. Additionally, a metaheuristic based on an iterated local search is proposed for the problem configuration under consideration. Focusing on minimizing the total weighted tardiness of orders, the efficiency of the heuristic approach is evaluated using comprehensive test data. Further, we show the importance of the considered order-related objective by using qualitative analysis.


Original languageEnglish
Pages (from-to)1-21
JournalInternational Journal of Production Research
Publication statusPublished - 24 Jan 2023

External IDs

Scopus 85146750060
Mendeley 4d986b6a-9b62-3264-818d-9b5fa46e47b7
ORCID /0000-0003-4711-2184/work/142252523
ORCID /0000-0003-0753-0517/work/142255248
WOS 000919920500001