IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v129y2024ics0305048324001051.html
   My bibliography  Save this article

Scheduling for additive manufacturing with two-dimensional packing and incompatible items

Author

Listed:
  • Zipfel, Benedikt
  • M’Hallah, Rym
  • Buscher, Udo

Abstract

Additive manufacturing technology can enable low-cost, efficient production of low-demand, highly-complex customized items with reduced lead time if production is judiciously planned. This paper addresses the assignment of requested items into batches and the scheduling of the batches onto 3D printers. The objective is to minimize the manufacturing makespan while satisfying items’ compatibility, two-dimensional no-overlap and containment packing constraints within a batch, and machine’s capability to manufacture a batch. The problem is modeled as a mixed integer linear program (MIP) that solves instances up to 100 items. For hard and large instances, this paper proposes a matheuristic that fathoms packings using a step-wise check procedure. Computational results reveal that the proposed heuristic improves the makespan of MIP solutions of hard instances by 12% on average, with improvements reaching up to 72% for instances with 150 items. They further show that the proposed heuristic finds the best makespan for 88% of all cases. Finally, we provide useful managerial insights for production flexibility and scheduling policies.

Suggested Citation

  • Zipfel, Benedikt & M’Hallah, Rym & Buscher, Udo, 2024. "Scheduling for additive manufacturing with two-dimensional packing and incompatible items," Omega, Elsevier, vol. 129(C).
    • Handle: RePEc:eee:jomega:v:129:y:2024:i:c:s0305048324001051
    DOI: 10.1016/j.omega.2024.103139
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324001051
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2024.103139?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:jomega:v:129:y:2024:i:c:s0305048324001051. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.