Olivér Ősz

Dr. Olivér Ősz

University of Pannonia, Veszprém, Hungary
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
4 August 2020 in Optimization and Engineering
Verified
Journal Article
Open access
PDF file
MHMáté Hegyháti
Máté Hegyháti
Tibor HolczingerTibor Holczinger
Tibor Holczinger
Olivér ŐszOlivér Ősz
Olivér Ősz
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.

24 November 2020 in Process Integration and Optimization for Sustainability
Verified
Journal Article
Closed access
PDF file
Olivér ŐszOlivér Ősz
Olivér Ősz
Dominic FooDominic Foo
Dominic Foo
MHMáté Hegyháti
Máté Hegyháti

25 May 2019 in Flexible Services and Manufacturing Journal
Verified
Journal Article
Open access
PDF file
Tibor HolczingerTibor Holczinger
Tibor Holczinger
Olivér ŐszOlivér Ősz
Olivér Ősz
MHMáté Hegyháti
Máté Hegyháti
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.

30 March 2023 in Central European Journal of Operations Research
Verified
Journal Article
Open access
PDF file
Olivér ŐszOlivér Ősz
Olivér Ősz
BDBalázs Dávid
Balázs Dávid
MHMáté Hegyháti
Máté Hegyháti
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.

29 April 2021 in Sustainability
Verified
Journal Article
Open access
PDF file
BDBalázs Dávid
Balázs Dávid
Olivér ŐszOlivér Ősz
Olivér Ősz
MHMáté Hegyháti
Máté Hegyháti
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.

20 July 2019 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
Olivér ŐszOlivér Ősz
Olivér Ősz
BFBalázs Ferenczi
Balázs Ferenczi
MHMáté Hegyháti
Máté Hegyháti
In this paper a new scheduling problem is presented, which originates from the steel processing industry. The optimal scheduling of a steel forge is investigated with the goal of minimizing setup and storage costs under strict deadlines and special resource constraints. The main distinctive feature of the problem is the deterioration of some equipment, in this case, the so-called forging dies. While the aging effect has been widely investigated in scheduling approaches, where production speed decreases through time, durability deterioration caused by equipment setup has not been addressed yet. In this paper a mixed-integer linear programming model is proposed for solving the problem. The model uses a uniform discrete time representation and resource-balance constraints based on the resource–task network model formulation method. The proposed method was tested on 3-week long schedules based on real industrial scenarios. Computational results show that the approach is able to provide optimal short-term schedules in reasonable time.