A JSSP Solution for Production Planning Optimization Combining Industrial Engineering and Evolutionary Algorithms

Sašo Sršen, Marjan Mernik

A Job Shop Scheduling Problem (JSSP), where p processes and n jobs should be processed on m machines so that the total completion time is minimal, is a well-known problem with many industrial applications. Many researchers focus on the JSSP classification and algorithms that address the different JSSP classes. In this research work, the production times, a very well-known theme covered in Industrial Engineering (IE), are integrated into an Evolutionary Algorithm (EA) to solve real-world JSSP problems. Since a drawback of classical IE is a manual determination of the technological times, an Internet of Things (IoT) architecture is proposed as a possible solution.