Olivér Ősz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Olivér Ősz has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Máté Hegyháti
University of Sopron, Bajcsy-Zs. u. 4, H9400 Sopron, Hungary
7 shared publications - Balázs Dávid
InnoRenew CoE, Andrej Marušič Institute and Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, 6000 Koper, Slovenia
3 shared publications - Tibor Holczinger
Department of Applied Informatics, University of Pannonia, Nagykanizsa, Hungary
2 shared publications Balázs Ferenczi
Department of Logistics and Forwarding, Széchenyi István University, Győr, Hungary
1 shared publication- Dominic Chwan Yee Foo
Centre for Green Technologies, Department of Chemical and Environmental Engineering, University of Nottingham Malaysia, Semenyih, Malaysia
1 shared publication - József Garab
Institute of Applied Sciences, Faculty of Wood Engineering and Creative Industry, University of Sopron, 9400 Sopron, Hungary
1 shared publication
Latest Publications
- Open Access
Mitigating Supply Chain Disruptions in Plywood Manufacturing by Deadline Reordering
Disruptions in supply networks have caused many logistical and planning challenges in the last few years. The previous predictability of the shipping times of raw materials changed drastically due to various global issues, which affected many production areas, including the wood industry. This work is motivated by a case study of a Central European plywood production facility, where supply-side disruptions caused difficulties in meeting deadlines for downstream companies of the construction and furniture industry. As a result, the objective of production planners shifted towards mitigating the financial burden caused by cancellation penalties. Three MILP (Mixed-Integer Linear Programming) models and a genetic algorithm were developed to tackle the scheduling of a plywood production plant with raw material shipments and order deadlines. The novelty of the considered problem lies in the flexibility of swapping order deadlines from the same client, which was inspired by the real-life deals of the aforementioned company. The methods were tested on 120 benchmark instances of different sizes generated from real industrial data. The genetic algorithm terminated within 60 s for all instances and found the optimal or best-known solution in 71 of 80 short-horizon instances, while also remaining efficient on larger 30-day cases. As the solution approach is not specific to plywood production, it can be applied to scheduling problems in other fields as well, where similar disruptions can develop, and the production process features are covered by the Multi-Mode Resource-Constrained Project Scheduling Problem class.
Open AccessMitigating Supply Chain Disruptions in Plywood Manufacturing by Deadline Reordering
Disruptions in supply networks have caused many logistical and planning challenges in the last few years. The previous predictability of the shipping times of raw materials changed drastically due to various global issues, which affected many production areas, including the wood industry. This work is motivated by a case study of a Central European plywood production facility, where supply-side disruptions caused difficulties in meeting deadlines for downstream companies of the construction and furniture industry. As a result, the objective of production planners shifted towards mitigating the financial burden caused by cancellation penalties. Three MILP (Mixed-Integer Linear Programming) models and a genetic algorithm were developed to tackle the scheduling of a plywood production plant with raw material shipments and order deadlines. The novelty of the considered problem lies in the flexibility of swapping order deadlines from the same client, which was inspired by the real-life deals of the aforementioned company. The methods were tested on 120 benchmark instances of different sizes generated from real industrial data. The genetic algorithm terminated within 60 s for all instances and found the optimal or best-known solution in 71 of 80 short-horizon instances, while also remaining efficient on larger 30-day cases. As the solution approach is not specific to plywood production, it can be applied to scheduling problems in other fields as well, where similar disruptions can develop, and the production process features are covered by the Multi-Mode Resource-Constrained Project Scheduling Problem class.
- Open Access
- 30 March 2023
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 31 (3) , 853-871
Comparison of discrete- and continuous-time models for scheduling waste wood processing facilities
With the growing significance of environmental awareness, the role of renewable materials and their reuse and recycling possibilities have become increasingly important. Wood is one of the best examples for this, as it is a material that has a variety of primary uses, while also being a prime candidate for reuse and recycling. An important phase in most waste wood value chains is the processing of bulk waste from various sources, usually by means of shredding. This paper presents methods for scheduling the machines in such a waste wood processing facility, where incoming deliveries of different types of wood are processed by a series of treatment and transformation steps to produce shredded wood. Two mathematical models are developed for the problem that both allow overlaps between consecutive steps to optimize resource flow through the system. One of these is a more traditional discrete-time model, while the other is precedence-based and uses continuous-time variables for the timing of the various tasks. Both modeling techniques have their advantages and shortcomings with regard to the ease of integration of further problem-specific parameters and requirements. Next to providing a sound approach for the identified problem class, another aim is to evaluate, which technique suits better for this problem class, and should be used as a basis for extended and integrated cases in the future. Thus, the performance of these models is compared on instances that were randomly generated based on real-world distributions from the literature.
- 30 March 2023
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 31 (3) , 853-871
Open AccessComparison of discrete- and continuous-time models for scheduling waste wood processing facilities
With the growing significance of environmental awareness, the role of renewable materials and their reuse and recycling possibilities have become increasingly important. Wood is one of the best examples for this, as it is a material that has a variety of primary uses, while also being a prime candidate for reuse and recycling. An important phase in most waste wood value chains is the processing of bulk waste from various sources, usually by means of shredding. This paper presents methods for scheduling the machines in such a waste wood processing facility, where incoming deliveries of different types of wood are processed by a series of treatment and transformation steps to produce shredded wood. Two mathematical models are developed for the problem that both allow overlaps between consecutive steps to optimize resource flow through the system. One of these is a more traditional discrete-time model, while the other is precedence-based and uses continuous-time variables for the timing of the various tasks. Both modeling techniques have their advantages and shortcomings with regard to the ease of integration of further problem-specific parameters and requirements. Next to providing a sound approach for the identified problem class, another aim is to evaluate, which technique suits better for this problem class, and should be used as a basis for extended and integrated cases in the future. Thus, the performance of these models is compared on instances that were randomly generated based on real-world distributions from the literature.
- Open Access
- 29 April 2021
- Published by MDPI AG in Sustainability
- Vol. 13 (9) , 5007
Robust Scheduling of Waste Wood Processing Plants with Uncertain Delivery Sources and Quality
While the study of reverse wood value chains has become an important topic recently, optimization-focused studies usually consider network-level problems and decisions, and do not address the individual processes in the network. In the case of waste wood, one such important process is the scheduling of the various machines in a waste wood processing facility to treat incoming wood deliveries with multiple sources and varying quality. This paper proposes a robust multi-objective mixed-integer linear programming model for the optimization of this process that considers the uncertain origins and compositions of the incoming deliveries, while aiming to minimize both lateness and energy consumption. An exhaustive study is performed on instance sets of different sizes and structures to show the efficiency and the limits of the proposed model both in single- and multi-objective cases.
- 29 April 2021
- Published by MDPI AG in Sustainability
- Vol. 13 (9) , 5007
Open AccessRobust Scheduling of Waste Wood Processing Plants with Uncertain Delivery Sources and Quality
While the study of reverse wood value chains has become an important topic recently, optimization-focused studies usually consider network-level problems and decisions, and do not address the individual processes in the network. In the case of waste wood, one such important process is the scheduling of the various machines in a waste wood processing facility to treat incoming wood deliveries with multiple sources and varying quality. This paper proposes a robust multi-objective mixed-integer linear programming model for the optimization of this process that considers the uncertain origins and compositions of the incoming deliveries, while aiming to minimize both lateness and energy consumption. An exhaustive study is performed on instance sets of different sizes and structures to show the efficiency and the limits of the proposed model both in single- and multi-objective cases.
- 24 November 2020
- Published by Springer Nature in Process Integration and Optimization for Sustainability
- Vol. 5 (1) , 31-42
Minimizing Freshwater Usage in Batch Process Scheduling: S-Graph Approach
- 24 November 2020
- Published by Springer Nature in Process Integration and Optimization for Sustainability
- Vol. 5 (1) , 31-42
Minimizing Freshwater Usage in Batch Process Scheduling: S-Graph Approach
- Open Access
- 4 August 2020
- Published by Springer Nature in Optimization and Engineering
- Vol. 22 (4) , 2679-2706
Addressing storage time restrictions in the S-graph scheduling framework
Storage planning and utilization are among the most important considerations of practical batch process scheduling. Modeling the available storage options appropriately can be crucial in order to find practically applicable solutions with the best objective value. In general, there are two main limitations on storage: capacity and time. This paper focuses on the latter and investigates different techniques to tackle limited storage time within the S-graph framework. The S-graph framework is a collection of combinatorial algorithms and a directed graph based model that has been introduced three decades ago and has been under development ever since. In this work, several options for addressing storage time limitations within the framework were implemented and tested for efficiency. The empirical results over a huge number of tests have unequivocally favored one of the approaches, which will be applied in later developments.
- 4 August 2020
- Published by Springer Nature in Optimization and Engineering
- Vol. 22 (4) , 2679-2706
Open AccessAddressing storage time restrictions in the S-graph scheduling framework
Storage planning and utilization are among the most important considerations of practical batch process scheduling. Modeling the available storage options appropriately can be crucial in order to find practically applicable solutions with the best objective value. In general, there are two main limitations on storage: capacity and time. This paper focuses on the latter and investigates different techniques to tackle limited storage time within the S-graph framework. The S-graph framework is a collection of combinatorial algorithms and a directed graph based model that has been introduced three decades ago and has been under development ever since. In this work, several options for addressing storage time limitations within the framework were implemented and tested for efficiency. The empirical results over a huge number of tests have unequivocally favored one of the approaches, which will be applied in later developments.
- Open Access
- 20 July 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 285 (1-2) , 353-367
Scheduling a forge with due dates and die deterioration
- 20 July 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 285 (1-2) , 353-367
Open AccessScheduling a forge with due dates and die deterioration
- Open Access
- 25 May 2019
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 32 (4) , 913-948
Scheduling approach for on-site jobs of service providers
Nowadays the successful operation of a company is unimaginable without fast and reliable communication. As a result, so-called Communication Service Providers play an important role in today’s business life. Their orders have to be carried out promptly and dependably, let them be requests for new installations, modifications, or maintenance tasks. These orders have to be performed at different locations and they often have deadlines or strict starting times. Violating such a timing requirement usually implies penalties. In this paper, scheduling problems arising at a Hungarian service provider are examined. At this company, orders are decomposed into smaller tasks, which can be performed by specially trained personnel. Transportation of these specialists contributes a lot to the costs and to the complexity of their scheduling, as well. The goal is to minimize the overall cost of satisfying all orders within the given time horizon with the available assets of the company. The proposed approach relies on the S-graph framework, which has been applied to various production scheduling problems in the literature. In addition to an unambiguous and sound S-graph model of the examined problem, slight modifications of the scheduling algorithms for cost minimization, and new bounding methods have been developed. Several of such bounds have been provided and tested for performance and scalability over a large number of generated examples. The sensitivity of the approach for certain problem features has also been examined.
- 25 May 2019
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 32 (4) , 913-948
Open AccessScheduling approach for on-site jobs of service providers
Nowadays the successful operation of a company is unimaginable without fast and reliable communication. As a result, so-called Communication Service Providers play an important role in today’s business life. Their orders have to be carried out promptly and dependably, let them be requests for new installations, modifications, or maintenance tasks. These orders have to be performed at different locations and they often have deadlines or strict starting times. Violating such a timing requirement usually implies penalties. In this paper, scheduling problems arising at a Hungarian service provider are examined. At this company, orders are decomposed into smaller tasks, which can be performed by specially trained personnel. Transportation of these specialists contributes a lot to the costs and to the complexity of their scheduling, as well. The goal is to minimize the overall cost of satisfying all orders within the given time horizon with the available assets of the company. The proposed approach relies on the S-graph framework, which has been applied to various production scheduling problems in the literature. In addition to an unambiguous and sound S-graph model of the examined problem, slight modifications of the scheduling algorithms for cost minimization, and new bounding methods have been developed. Several of such bounds have been provided and tested for performance and scalability over a large number of generated examples. The sensitivity of the approach for certain problem features has also been examined.