Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Krisztián Attila Bakon has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Perspective Chapter: From Industry 4.0 to 5.0 – Human-Centered Digitalization for Sustainable Heritage Tourism

    by Krisztián Attila Bakon

    This chapter examines how Industry 4.0 technologies can be strategically repurposed beyond manufacturing to support human-centered, sustainable, and culturally embedded experiences in industrial-heritage tourism. While cyber-physical systems, artificial intelligence, and large-scale digitization have traditionally prioritized efficiency and automation, their potential to advance social, cultural, and environmental objectives remains underdeveloped. Building on recent scholarship in human-centered digitalization and the evolving paradigm of Industry 5.0, we propose the Human-Centered Heritage Experience Design Model – a conceptual framework that integrates augmented reality, virtual reality, mobile applications, and artificial intelligence-enhanced systems within heritage-driven industrial contexts. The model repositions technology as a facilitator of participatory engagement, digital storytelling, and stakeholder co-creation, emphasizing cultural authenticity, community agency, and socio-technical sustainability. Through illustrative application scenarios, we demonstrate how immersive technologies can enable inclusive learning, strengthen place-based identity, and reduce environmental impacts by minimizing reliance on physical infrastructure. At the same time, we address implementation challenges such as infrastructure disparities, digital ethics, institutional inertia, and cultural commodification. Ultimately, this work reframes Industry 4.0 tools as enablers of post-industrial regeneration, arguing that human-centered digitalization offers a viable pathway for aligning technological innovation with cultural preservation, community resilience, and the green transition in heritage tourism ecosystems.

  • Open Access

    Agile Circularity: Reactive Scheduling Approaches

    by Krisztián Attila Bakon

    Reactive scheduling is essential for optimizing resource flows in the circular economy. This chapter explores agile scheduling strategies that enable real-time adaptation to disruptions and changes, ensuring efficient utilization of materials and minimizing waste. By leveraging dynamic resource allocation and closed-loop systems, organizations can build resilient supply chains capable of responding to evolving market demands and sustainability requirements. Key topics include supply chain agility, sustainable operations management, and material flow optimization techniques tailored for circular business models. The chapter provides practical insights and case studies demonstrating the benefits of reactive scheduling in driving the transition toward a more sustainable, circular future.

  • Open Access

    Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework

    by Krisztián Attila Bakon, 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.

  • Open Access

    S-Graph-Based Reactive Scheduling with Unexpected Arrivals of New Orders

    by Krisztián Attila Bakon, 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.


  • Open Access

    Optimization with uncertainties: a scheduling example

    by Máté Hegyháti, Krisztián Attila Bakon, 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.


  • Open Access

    Scheduling Under Uncertainty for Industry 4.0 and 5.0

    by Krisztian Bakon, Tibor Holczinger, Zoltan Sule, Szilard Jasko, 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.


  • Open Access

    S-Graph Based Reactive Scheduling with Unexpected Arrivals of New Orders

    by Krisztián Attila Bakon, Tibor Holczinger

    During the manufacturing process unexpected events can occur, like machine breakdown, lateness of raw material, arrival of a new job.These uncertainties have to be handled to maintain the feasibility and the optimality of the system.The efficiency of a production system greatly depends on the optimality of the scheduling plan.This paper proposes an S-graph based reactive scheduling approach that can handle the arrival of new jobs and it can provide a schedule with the shortest makespan (maximum completion time). Each time, when a new order arrives, the method reschedules the production plan.Three policies are identified, which define which tasks need scheduling or rescheduling and which task's schedule cannot be modified.To validate and to test the efficiency of the algorithm, three literature examples are solved.Based on the results, it can be stated that the proposed approach is effective.

  • Open Access

    Digital factory in the University of Pannonia Nagykanizsa Campus - the Factory Subsystem

    by Krisztián Attila Bakon, Adrienn Skrop, Szilárd Jaskó, 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.