文章基本信息

标题：Solving the problem of scheduling the production process based on heuristic algorithms
本地全文：下载
作者：Dagmara Łapczyńska ; Konrad Łapczyński ; Anna Burduk 等
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2022
卷号：28
期号：3
页码：292-310
DOI：10.3897/jucs.80750
语种：English
出版社：Graz University of Technology and Know-Center
摘要：The paper deals with a production scheduling process, which is a problematic and it requires considering a lot of various factors while making the decision. Due to the specificity of the production system analysed in the practical example, the production scheduling problem was classified as a Job-shop Scheduling Problem (JSP). The production scheduling process, especially in the case of JSP, involves the analysis of a variety of data simultaneously and is well known as NP-hard problem. The research was performed in partnership with a company from the automotive industry. The production scheduling process is a task that is usually performed by process engineers. Thus, it can often be affected by mistakes of human nature e.g. habits, differences in experience and knowledge of engineers (their know-how), etc. The usage of heuristic algorithms was proposed as the solution. The chosen methods are genetic and greedy algorithms, as both of them are suitable to resolve a problem that requires analysing a lot of data. The paper presents both approaches: practical and theoretical aspects of the usefulness and effectiveness of genetic and greedy algorithms in a production scheduling process.