Affiliation:
1. University of Maribor, Faculty of Electrical Engineering and Computer Science, Maribor, Slovenia
Abstract
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 present a solution for real-world manufacturing JSSP problems solving. 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.
Publisher
National Library of Serbia
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献