Přístupnostní navigace
E-application
Search Search Close
Publication detail
ŠŤASTNÝ, J. ŠKORPIL, V. BALOGH, Z. KLEIN, R.
Original Title
Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm
Type
journal article in Web of Science
Language
English
Original Abstract
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.
Keywords
Genetic algorithms; graph-based algorithm; Job Shop Scheduling Problem; optimization
Authors
ŠŤASTNÝ, J.; ŠKORPIL, V.; BALOGH, Z.; KLEIN, R.
Released
22. 2. 2021
Publisher
MDPI
Location
Basel, Switzerland
ISBN
2076-3417
Periodical
Applied Sciences - Basel
Year of study
11
Number
4
State
Swiss Confederation
Pages from
1
Pages to
16
Pages count
URL
https://www.mdpi.com/2076-3417/11/4/1921/htm
Full text in the Digital Library
http://hdl.handle.net/11012/196375
BibTex
@article{BUT170162, author="Jiří {Šťastný} and Vladislav {Škorpil} and Zoltán {Balogh} and Richard {Klein}", title="Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm", journal="Applied Sciences - Basel", year="2021", volume="11", number="4", pages="1--16", doi="10.3390/app11041921", issn="2076-3417", url="https://www.mdpi.com/2076-3417/11/4/1921/htm" }