Open AccessA COMPARATIVE STUDY OF THE USABILITY OF DIFFERENT PRODUCTION SCHEDULING ALGORITHMS AND RULES
Author(s) -
Pavol Jurík
Publication year - 2021
Publication title -
proceedings of cbu in natural sciences and ict ...
Language(s) - English
Resource type - Journals
eISSN - 2695-0766
pISSN - 2695-0758
DOI - 10.12955/pns.v2.151
Subject(s) - computer science , scheduling (production processes) , usability , flow shop scheduling , algorithm , production planning , production (economics) , job shop scheduling , mathematical optimization , schedule , mathematics , human–computer interaction , economics , macroeconomics , operating system
Production scheduling optimization is a very important part of a production process. There are production systems with one service object and systems with multiple service objects. When using several service objects, there are systems with service objects arranged in a parallel or in a serial manner. We also distinguish between systems such as flow shop, job shop, open shop and mixed shop. Throughout the history of production planning, a number of algorithms and rules have been developed to calculate optimal production plans. These algorithms and rules differ from each other in the possibilities and conditions of their application. Since there are too many possible algorithms and rules it is not easy to select the proper algorithm or rule for solving a specific scheduling problem. In this article we analyzed the usability of 33 different algorithms and rules in total. Each algorithm or rule is suitable for a specific type of problem. The result of our analysis is a set of comparison tables that can serve as a basis for making the right decision in the production process decision-making process in order to select the proper algorithm or rule for solving a specific problem. We believe that these tables can be used for a quick and easy selection of the proper algorithm or rule for solving some of the typical production scheduling problems.