Next Article in Journal
Performance Evaluation of Hybrid WOA-SVR and HHO-SVR Models with Various Kernels to Predict Factor of Safety for Circular Failure Slope
Previous Article in Journal
Evaluation of Emotional Satisfaction Using Questionnaires in Voice-Based Human–AI Interaction
Article

Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm

1
Institute of Automation and Computer Science, Brno University of Technology, 616 69 Brno, Czech Republic
2
Department of Informatics, Mendel University in Brno, 613 00 Brno, Czech Republic
3
Department of Telecommunications, Brno University of Technology, 616 00 Brno, Czech Republic
4
Computer Science Department, Constantine the Philosopher University in Nitra, 949 74 Nitra, Slovakia
*
Author to whom correspondence should be addressed.
Academic Editor: Alexandre Carvalho
Appl. Sci. 2021, 11(4), 1921; https://doi.org/10.3390/app11041921
Received: 11 January 2021 / Revised: 15 February 2021 / Accepted: 17 February 2021 / Published: 22 February 2021
(This article belongs to the Section Applied Industrial Technologies)
In this paper we introduce the draft of a new graph-based algorithm for optimization of scheduling problems. Our algorithm is based on the Generalized Lifelong Planning A* algorithm, which is usually used for path planning for mobile robots. It was tested on the Job Shop Scheduling Problem against a genetic algorithm’s classic implementation. The acquired results of these experiments were compared by each algorithm’s required time (to find the best solution) as well as makespan. The comparison of these results showed that the proposed algorithm exhibited a promising convergence rate toward an optimal solution. Job shop scheduling (or the job shop problem) is an optimization problem in informatics and operations research in which jobs are assigned to resources at particular times. The makespan is the total length of the schedule (when all jobs have finished processing). In most of the tested cases, our proposed algorithm managed to find a solution faster than the genetic algorithm; in five cases, the graph-based algorithm found a solution at the same time as the genetic algorithm. Our results also showed that the manner of priority calculation had a non-negligible impact on solutions, and that an appropriately chosen priority calculation could improve them. View Full-Text
Keywords: Genetic algorithms; graph-based algorithm; Job Shop Scheduling Problem; optimization Genetic algorithms; graph-based algorithm; Job Shop Scheduling Problem; optimization
Show Figures

Figure 1

MDPI and ACS Style

Stastny, J.; Skorpil, V.; Balogh, Z.; Klein, R. Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm. Appl. Sci. 2021, 11, 1921. https://doi.org/10.3390/app11041921

AMA Style

Stastny J, Skorpil V, Balogh Z, Klein R. Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm. Applied Sciences. 2021; 11(4):1921. https://doi.org/10.3390/app11041921

Chicago/Turabian Style

Stastny, Jiri, Vladislav Skorpil, Zoltan Balogh, and Richard Klein. 2021. "Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm" Applied Sciences 11, no. 4: 1921. https://doi.org/10.3390/app11041921

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop