Optimization of Job Shop Scheduling Problem Using Genetic Algorithm and Simulated Annealing: A Case Study of Manufacturing Industry

Production scheduling is an important activity within the manufacturing system to improve its performance. It is a process of assigning resources to the task or vice versa, which depends upon the configuration of the shop floor and the type of products to be manufactured. In job shops, scheduling is a very complex task since it involves a variety of products to process on a limited number of machines to cut down on the amount of time it takes to do tasks. In the present work, a case study from the manufacturing industry has been taken to maximise the amount of time it takes to do tasks ( i.e., makespan) having job shop configuration. Two distinguished nature-inspired algorithms, viz Simulated Annealing (SA) and Genetic Algorithm (GA), have been pragmatic in optimising the existing schedule. The results show that GA outperform the SA by a 1.76% increment in the makespan value. Also, the GA and SA possessed better results than the company's existing production schedule by 32.23% and 31.02%, respectively.