Part-grouping and build-scheduling with sequence-dependent setup time to minimize the makespan for non-identical parallel additive manufacturing machines

Abstract

This paper addresses a part-grouping and build-scheduling problem for an additive manufacturing process with non-identical parallel additive manufacturing machines. Parts with the same material can be simultaneously manufactured as a build in the machine. The total areas of parts in the build cannot exceed the area capacity of the machine. Each machine has different heights in a build area. The maximum height of parts in the build is less than or equal to the height of each machine in the build area. The processing time of each build is the maximum processing time of parts belonging to the build. When the material is changed in each machine, the setup time occurs. The objective function is minimizing the makespan. To find optimal and near-optimal solutions for the problem, a mixed integer linear programming model and three meta-heuristic algorithms are presented. For small problem instances, the performance of three meta-heuristic algorithms is compared with the optimal value obtained mixed integer linear programming model. For large problem instances, the performance of three meta-heuristic algorithms is compared to each other.

A Heuristic Scheduling Algorithm in Cloud-Based Additive Manufacturing; an Approach to Using Critical Chain Buffer Management Technique

“…Alicastro et al proposed a reinforcement learning iterated local search meta-heuristic, based on the implementation of a Q-learning variable neighborhood search, to provide heuristically good solutions at the cost of low computational expenses [23]. Kim and Kim addressed a part-grouping and build-scheduling problem for an additive manufacturing process with non-identical parallel additive manufacturing machines [24].…”

Parallel batch processing machines scheduling for SLM additive manufacturing in cloud manufacturing

“…Li et al [8] then studied the problem of minimizing job completion time on a single batch processing machine with 2D packing constraints, representing the machine platform as a 2D rectangle, where each job occupies the size of a rectangle. Kim et al [9] and Toksarı et al [10] considered multi-material part production, aiming to directly minimize the maximum completion time of multi-material part production plans and indirectly minimize material changeovers. Chergui et al [11] and Rohaninejad et al [12] further considered customer order due date problems.…”