IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v53y2021i9p960-973.html
   My bibliography  Save this article

Improved co-scheduling of multi-layer printing path scanning for collaborative additive manufacturing

Author

Listed:
  • Zhengqian Jiang
  • Hui Wang
  • Yanshuo Sun

Abstract

Additive manufacturing processes, especially those based on fused filament fabrication mechanism, have a low productivity. One solution to this problem is to adopt a collaborative additive manufacturing system that employs multiple printers/extruders working simultaneously to improve productivity by reducing the process makespan. However, very limited research is available to address the major challenges in the co-scheduling of printing path scanning for different extruders. Existing studies lack: (i) a consideration of the impact of sub-path partitions and simultaneous printing of multiple layers on the multi-extruder printing makespan; and (ii) efficient algorithms to deal with the multiple decision-making involved. This article develops an improved method by first breaking down printing paths on different printing layers into sub-paths and assigning these generated sub-paths to different extruders. A mathematical model is formulated for the co-scheduling problem, and a hybrid algorithm with sequential solution procedures integrating an evolutionary algorithm and a heuristic is customized to multiple decision-making in the co-scheduling for collaborative printing. The performance was compared with the most recent research, and the results demonstrated further makespan reduction when sub-path partition or the simultaneous printing of multiple layers is considered. This article discusses the impacts of process setups on makespan reduction, providing a quantitative tool for guiding process development.

Suggested Citation

  • Zhengqian Jiang & Hui Wang & Yanshuo Sun, 2021. "Improved co-scheduling of multi-layer printing path scanning for collaborative additive manufacturing," IISE Transactions, Taylor & Francis Journals, vol. 53(9), pages 960-973, June.
  • Handle: RePEc:taf:uiiexx:v:53:y:2021:i:9:p:960-973
    DOI: 10.1080/24725854.2020.1807076
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2020.1807076
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2020.1807076?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:uiiexx:v:53:y:2021:i:9:p:960-973. 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/uiie .

    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.