Optimization of job shop system with parallel machines using simulation

In this paper the problem of job shop with parallel machines is discussed. Job shop system with parallel machines is one of most important and practical issues of optimization in the recent decades that has attracted many researchers. In this study, scheduling are studied in uncertain situation. In other words setup and process time for each job on each machine are uncertain. The objective is to minimize the maximum completion time (Cmax). But because of considering uncertainty, the use of exact algorithmsis met with skepticism. This is a serious challenge in these models. In such situations, simulation technique is one of the most populart techniques that can be used to investigate these problems. In this paper, the studied model is simulated using Arena software to investigate the system functionality and its weaknesses. In order to overcome these weaknesses and improve the ongoing situation the management was forced to come up with suggested solutions. Finally, in order to find the optimal solution due to the goal function, which was the average completion time of products, the optquest tool was employed.