A model for job shop scheduling with a parallel assembly stage to minimize makespan

In this research، job shop scheduling problem by considering a parallel assembly stage is studied to minimize completion time for all products. At first، a linear model is introduced to describe the problem. To confirm the accuracy of model، it is solved by LINGO software. Since this problem is classified as NP-Hard، a particle swarm optimization algorithm is suggested to solve the problem in large and medium dimensions. To analyze the efficiency of the suggested algorithm، result of the proposed algorithm are compared with the results gained from GA algorithm. This results show that suggested algorithm can reach to near-optimal solutions in various dimensions of problems.