IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i3p605-625.html
   My bibliography  Save this article

An iterated local search for customer order scheduling in additive manufacturing

Author

Listed:
  • Benedikt Zipfel
  • Janis Neufeld
  • Udo Buscher

Abstract

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.

Suggested Citation

  • Benedikt Zipfel & Janis Neufeld & Udo Buscher, 2024. "An iterated local search for customer order scheduling in additive manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 62(3), pages 605-625, February.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:3:p:605-625
    DOI: 10.1080/00207543.2023.2167015
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2167015
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2167015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:62:y:2024:i:3:p:605-625. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.