Intelligent Cooperation by Solving a Two-Stage Production Assembly Scheduling Problem with a Heuristic Algorithm in Canned Food Plant

We consider a two-stage production assembly scheduling problem which includes processing stage and assembly stage. In first stage, the parts of these products are produced by these parallel machines, and each machine can process only one of these parts at a time. There is only one single assembly machine or a group of assembly workers in the second stage. In this problem, the objective is to minimize total completion time. The two-stage assembly scheduling problem is an NP-hard problem, so that it is very difficult and time consuming to obtain the optimal solution. This paper proposes a heuristic algorithm to solve the total completion time of two-stage assembly scheduling problem. Then, this algorithm is tested on the issue in different sizes and compare with the discrete particle swarm optimization (DPSO) algorithm. The results show that the proposed heuristic algorithm is a very efficient algorithm for assembly scheduling problem.