IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v325y2025i3p416-432.html
   My bibliography  Save this article

Including mechanical requirements in a bi-objective nesting and scheduling model for additive manufacturing

Author

Listed:
  • Kucukkoc, Ibrahim
  • Finco, Serena
  • Peron, Mirco
  • Aydin Keskin, Gulsen

Abstract

Following the increasing relevance of Additive Manufacturing (AM) as Manufacturing-as-a-service (Maas), the AM scheduling (and related nesting) problem has been increasingly investigated. Due to their business nature, Maas companies are interested in minimizing both the makespan and the total tardiness; however, most of the literature focuses only on one of them. This work fills this gap proposing a mixed-integer linear programming (MILP) model that minimizes both makespan and total tardiness. In doing so, for the first time in the literature, considerations on parts’ strength are included. During nesting procedures, indeed, parts can be oriented in different ways, with this choice affecting not only the total processing time (as considered by the literature) but also the strength achievable: if this is lower than what planned, parts might fail unexpectedly with detrimental consequences. Thus, this work ensures that parts are produced with the required strength. In doing so, we focus on a parallel unrelated AM batch scheduling problem for metallic parts.

Suggested Citation

  • Kucukkoc, Ibrahim & Finco, Serena & Peron, Mirco & Aydin Keskin, Gulsen, 2025. "Including mechanical requirements in a bi-objective nesting and scheduling model for additive manufacturing," European Journal of Operational Research, Elsevier, vol. 325(3), pages 416-432.
  • Handle: RePEc:eee:ejores:v:325:y:2025:i:3:p:416-432
    DOI: 10.1016/j.ejor.2025.03.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172500219X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.03.022?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.

    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:eee:ejores:v:325:y:2025:i:3:p:416-432. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.