Krisztián Attila Bakon

Mr. Krisztián Attila Bakon

Department of Applied Informatics, University of Pannonia, Veszprém, Hungary
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 July 2022 in IEEE Access
Verified
Journal Article
Open access
Krisztián Attila BakonKrisztián Attila Bakon
Krisztián Attila Bakon
Tibor HolczingerTibor Holczinger
Tibor Holczinger
ZSZoltán Süle
Zoltán Süle
Szilárd JaskóSzilárd Jaskó
Szilárd Jaskó
Janos AbonyiJanos Abonyi
Janos Abonyi
This article provides a review about how uncertainties in increasingly complex production and supply chains should be addressed in scheduling tasks. Uncertainty management will be particularly important in Industry 5.0 solutions that will require the close integration of operators and technical systems. To prepare for these challenging developments, this work reviews the sources of uncertainty and the scheduling algorithms that deal with the different types of models developed to handle the uncertain nature of the elements and the environment of complex technological systems. The paper not only identifies the challenges, but also the main building blocks that can help to manage and reduce uncertainties based on the I4.0 and I5.0 solutions. We hope that this study will serve as a starting point for R&D projects and algorithm developments, which will be needed primarily in the field of multi-agent, multistage and inverse optimizations.

30 June 2023 in Central European Journal of Operations Research
Verified
Journal Article
Open access
PDF file
MHMáté Hegyháti
Máté Hegyháti
Krisztián Attila BakonKrisztián Attila Bakon
Krisztián Attila Bakon
Tibor HolczingerTibor Holczinger
Tibor Holczinger
The optimization of manufacturing systems is rarely a deterministic task in practice, as uncertainties of various origins often have significant impact on the feasibility or quality of a production plan. The decision making process is often a complex multi-stage mechanism that anticipates and reacts to numerous parameter changes, both internal and external. Such optimization problems and the corresponding approaches are often classified and categorized based on the features of the addressed uncertainties and the desired objective. The goal of this paper is twofold. First, a systematic approach is presented to enumerate the possible optimization problems for a given set of uncertainties and degree of freedom in the planning. This approach is illustrated via a scheduling example that is inspired by literature case studies and focuses on financial objectives with varying demands and prices in the market. Then, selected problem classes identified by the approach are discussed in detail, illustrating and examining the available techniques to tackle them, citing literature studies applying the same or similar approaches.

27 June 2024 in Machines
Verified
Journal Article
Open access
PDF file
Krisztián Attila BakonKrisztián Attila Bakon
Krisztián Attila Bakon
Tibor HolczingerTibor Holczinger
Tibor Holczinger
Manufacturing processes are often disrupted by unexpected events, such as machine breakdowns, raw material shortages, and the arrival of new orders. Effectively managing these uncertainties is crucial for maintaining the feasibility and optimality of the production system. The efficiency of a manufacturing system is heavily dependent on the optimality of its scheduling plan. In this study, we present a reactive scheduling approach based on the S-graph framework. The proposed method is specifically designed to handle the arrival of new jobs and generate schedules with the shortest makespan, i.e., the minimum total completion time. Whenever a new order is received, the method dynamically adjusts the production plan through rescheduling. Three distinct scheduling policies are identified that determine which tasks require scheduling or rescheduling and which tasks should remain unchanged in their schedules. To evaluate the effectiveness of the algorithm, we solve several examples from the literature and analyze the results. The findings demonstrate the efficiency and efficacy of the proposed approach. The ability to accommodate new job arrivals and generate schedules with a minimized makespan highlights the practical relevance and benefits of the S-graph-based reactive scheduling method.

25 June 2019 in Analecta Technica Szegedinensia
Verified
Journal Article
Open access
PDF file
Krisztián Attila BakonKrisztián Attila Bakon
Krisztián Attila Bakon
ASAdrienn Skrop
Adrienn Skrop
Szilárd JaskóSzilárd Jaskó
Szilárd Jaskó
Tibor HolczingerTibor Holczinger
Tibor Holczinger
One of the new challenges of the 21st century is the Industry 4.0. Manufacturing companies moving away from mass production and getting closer to customized production and manufacturing of customized products through digitization. The expectations are high, meeting the requirements is a real challenge to industrial partners. In order to help meet the challenges the University of Pannonia Nagykanizsa Campus started to establish a fully automatized industrial laboratory. In this paper the architecture of the Industry 4.0 laboratory and the purpose of the Factory Subsystem is presented.


9 February 2025 in Machines
Verified
Journal Article
Open access
PDF file
Krisztián Attila BakonKrisztián Attila Bakon
Krisztián Attila Bakon
Tibor HolczingerTibor Holczinger
Tibor Holczinger
This paper addresses the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimizing both earliness/tardiness (E/T) and intermediate storage time (IST). An extended S-graph framework that incorporates E/T and IST minimization while maintaining the structural advantages of the original S-graph approach is presented. The framework is further enhanced by integrating linear programming (LP) techniques to adjust machine assignments and operation timings dynamically. The following four methodological approaches are systematically analyzed: a standalone S-graph for E/T minimization, an S-graph for combined E/T and IST minimization, a hybrid S-graph with LP for E/T minimization, and a comprehensive hybrid approach addressing both E/T and IST. Computational experiments on benchmark problems demonstrate the efficacy of the proposed methods, with the standalone S-graph showing efficiency for smaller instances and the hybrid approaches offering improved solution quality for more complex scenarios. The research provides insights into the trade-offs between computational time and solution quality across different problem configurations and storage policies. This work contributes to the field of production scheduling by offering a versatile framework capable of addressing the multi-objective nature of modern manufacturing environments.