Toolpath allocation and scheduling for concurrent fused filament fabrication with multiple extruders. (1st February 2019)

• Record Type: Journal Article
• Authors: Jin, Yu; Pierson, Harry A.; Liao, Haitao
• Is Part Of: IISE transactions. Volume 51:Number 2(2019)
• Page Start: 192
• Page End: 208
• Publication Date: 2019-02-01
• Subjects: Additive manufacturing -- 3D printing -- toolpath allocation -- toolpath scheduling -- concurrent fused filament fabrication -- multiple extruders; Industrial engineering -- Periodicals; Systems engineering -- Periodicals; Industrial engineering; Systems engineering; Electronic journals; Periodicals; 670.285
• DOI: 10.1080/24725854.2017.1374582
• Languages: English
• ISSNs: 2472-5854

Abstract

ABSTRACT: Fused filament fabrication, like most layer-wise additive manufacturing processes, is hindered by low production rates and scalability issues. Concurrent fused filament fabrication mitigates these disadvantages by distributing the processing of each layer among multiple extruders working in parallel. The objective of this work is to develop a general toolpath allocation and scheduling methodology to achieve this objective. Breaks in a toolpath that are inherently created by slicing software for single-extruder machines are used to form sub-paths, and the assignment of these to available extruders is formulated as a scheduling problem with collision constraints. A formal optimization model is presented, and two novel heuristics are developed to obtain approximate solutions. Three case studies demonstrate the application of these algorithms and compare their relative performance with respect to fabrication time and computational cost. In simulations with three extruders, layer printing times were reduced by as much as 60% compared with single-extruder machines. The proposed heuristics also exceeded the performance of two baseline toolpath scheduling algorithms by as much as 45%. Two key layer characteristics were found to influence heuristic performance, and the advantages and disadvantages of each algorithm are discussed in the context of these characteristics.