Machining route selection with subcontracting using genetic algorithm

This paper addresses a problem of machining route selection in multi-stage process with machine group. The problem is considered the subcontracting and the production in-house such as regular and overtime work. The proposed model is formulated as a 0–1 integer programming constraining the available time of each machine for planning period and total overtimes. The objective of the model is to minimize the sum of processing cost, overtime cost, and subcontracting cost. To solve this model, a genetic algorithm (GA) approach is developed. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound. In results, the same optimal solution is obtained from two methods at small size problem, and the consistent solution is provided by the GA approach at large size problem. The advantage of the GA approach is the flexibility into decision-making process because of providing multiple machining routes.