Loading algorithms for flexible manufacturing systems with partially grouped unrelated machines and additional tooling constraints

초록

This paper considers the loading problem for flexible manufacturing systems with highly flexible partial machine grouping, i.e., machines are tooled differently, but each operation can be assigned to multiple machines. Loading is the problem of allocating operations and their associated cutting tools to machines for a given set of parts. As an extension of the existing studies, we consider unrelated machines, i.e., processing time of an operation depends on the speed of the machine to which it is allocated, and dedicated machines, i.e., certain part types must be processed on a specific machine. Also, we consider the constraints associated with cutting tools: (a) tool life restrictions and (b) number of available tool copies. An integer linear programming model is suggested for the objective of balancing the workloads assigned to machines and then due to the complexity of the problem, we suggest two-stage heuristics in which an initial solution is obtained using modified bin-packing algorithms and then it is improved by a simple search technique. The two-stage heuristics suggested in this study were tested on various test instances, and the results show that they can give reasonable quality solutions within a very short amount of computation time. Also, a sensitivity analysis was done on the tightness of the tooling constraints, and the results are reported.

키워드