Authors: HyungWon Kim JaeMin Yu JiSu Kim HyoungHo Doh DongHo Lee SungHo Nam
Publish Date: 2011/06/10
Volume: 58, Issue: 5-8, Pages: 683-691
Abstract
This paper considers the loading problem for flexible manufacturing systems with highly flexible partial machine grouping ie 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 ie processing time of an operation depends on the speed of the machine to which it is allocated and dedicated machines ie 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 twostage heuristics in which an initial solution is obtained using modified binpacking algorithms and then it is improved by a simple search technique The twostage 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
Keywords: