Curriculum vitae of Máté Hegyháti, PhD - List of Publications & Graduated Ph.D. students

Journal articles & short papers31

new Máté Hegyháti , Krisztián Attila Bakon , Tibor Holczinger

Optimization with uncertainties: a scheduling example

Central European Journal of Operations Research, 2023

https://doi.org/10.1007/s10100-023-00854-4

BibTex for Hegyhati2023 -

@ARTICLE{ Hegyhati2023, author = { Máté Hegyháti and Krisztián Attila Bakon and Tibor Holczinger }, title = { Optimization with uncertainties: a scheduling example }, journal = { Central European Journal of Operations Research }, year = { 2023 }, volume = { }, pages = { }, doi = { https://doi.org/10.1007/s10100-023-00854-4 }, url = { https://link.springer.com/article/10.1007/s10100-023-00854-4 }, }
new Olivér Ősz , Balázs Dávid , Máté Hegyháti

Comparison of discrete- and continuous-time models for scheduling waste wood processing facilities

Central European Journal of Operations Research, 2023

https://doi.org/10.1007/s10100-023-00852-6

BibTex for Osz2023 -

@ARTICLE{ Osz2023, author = { Olivér Ősz and Balázs Dávid and Máté Hegyháti }, title = { Comparison of discrete- and continuous-time models for scheduling waste wood processing facilities }, journal = { Central European Journal of Operations Research }, year = { 2023 }, volume = { }, pages = { }, doi = { https://doi.org/10.1007/s10100-023-00852-6 }, url = { https://link.springer.com/article/10.1007/s10100-023-00852-6 }, }
new Máté Hegyháti

Systematic generation of precedence based MILP models with P-graphs for multipurpose scheduling problems

Information Society - Proceedings of MATCOS 2022, 2022 ,1, 25-28

BibTex for Hegyhati2022 -

@ARTICLE{ Hegyhati2022, author = { Máté Hegyháti }, title = { Systematic generation of precedence based MILP models with P-graphs for multipurpose scheduling problems }, journal = { Information Society - Proceedings of MATCOS 2022 }, year = { 2022 }, volume = { 1 }, pages = { 25-28 }, url = { http://library.ijs.si/Stacks/Proceedings/InformationSociety/2022/IS2022_Volume-I%20-%20MATCOS.pdf }, }
Balázs Dávid , Olivér Ősz , Máté Hegyháti

Scheduling of Waste Wood Processing Facilities with Overlapping Jobs

Proceedings of the 16th International Symposium on Operational Research in Slovenia, 2021

BibTex for David2021b -

@ARTICLE{ David2021b, author = { Balázs Dávid and Olivér Ősz and Máté Hegyháti }, title = { Scheduling of Waste Wood Processing Facilities with Overlapping Jobs }, journal = { Proceedings of the 16th International Symposium on Operational Research in Slovenia }, year = { 2021 }, volume = { }, pages = { 321-326 }, url = { http://fgg-web.fgg.uni-lj.si/~/sdrobne/sor/SOR'21%20-%20Proceedings.pdf }, }
Balázs Dávid , Olivér Ősz , Máté Hegyháti

Robust Scheduling of Waste Wood Processing Plants with Uncertain Delivery Sources and Quality

Sustainability, 2021 ,13, 5007

10.3390/su13095007

BibTex for David2021 -

@ARTICLE{ David2021, author = { Balázs Dávid and Olivér Ősz and Máté Hegyháti }, title = { Robust Scheduling of Waste Wood Processing Plants with Uncertain Delivery Sources and Quality }, journal = { Sustainability }, year = { 2021 }, volume = { 13 }, pages = { 5007 }, doi = { 10.3390/su13095007 }, url = { https://doi.org/10.3390/su13095007 }, }
Olivér Ősz , Dominic C.Y. Foo , Máté Hegyháti

Minimizing Freshwater Usage in Batch Process Scheduling: S-Graph Approach

Process Integration and Optimization for Sustainability, 2020 ,5, 31-42

10.1007/s41660-020-00142-7

BibTex for Osz2020 -

@ARTICLE{ Osz2020, author = { Olivér Ősz and Dominic C.Y. Foo and Máté Hegyháti }, title = { Minimizing Freshwater Usage in Batch Process Scheduling: S-Graph Approach }, journal = { Process Integration and Optimization for Sustainability }, year = { 2020 }, volume = { 5 }, pages = { 31-42 }, doi = { 10.1007/s41660-020-00142-7 }, url = { https://doi.org/10.1007/s41660-020-00142-7 }, }
Máté Hegyháti , Tibor Holczinger , Olivér Ősz

Addressing storage time restrictions in the S-graph scheduling framework

Optimization and Engineering, 2020

10.1007/s11081-020-09548-1

BibTex for Hegyhati2020 -

@ARTICLE{ Hegyhati2020, author = { Máté Hegyháti and Tibor Holczinger and Olivér Ősz }, title = { Addressing storage time restrictions in the S-graph scheduling framework }, journal = { Optimization and Engineering }, year = { 2020 }, volume = { }, pages = { }, doi = { 10.1007/s11081-020-09548-1 }, url = { https://doi.org/10.1007/s11081-020-09548-1 }, }
Olivér Ősz , Máté Hegyháti

Energy usage minimization with the S-graph framework

Information Society - Proceedings of MATCOS 2019, 2019 ,1, 59-62

BibTex for Osz2019a -

@ARTICLE{ Osz2019a, author = { Olivér Ősz and Máté Hegyháti }, title = { Energy usage minimization with the S-graph framework }, journal = { Information Society - Proceedings of MATCOS 2019 }, year = { 2019 }, volume = { 1 }, pages = { 59-62 }, url = { https://matcos.iam.upr.si/en/resources/files///is2019volumei---matcos.pdf }, }
Máté Hegyháti , Olivér Ősz , Tibor Holczinger

Empirical Study of S-graph Approaches for Limited-Wait Storage Policy

Information Society - Proceedings of MATCOS 2019, 2019 ,1, 43-46

BibTex for Hegyhati2019 -

@ARTICLE{ Hegyhati2019, author = { Máté Hegyháti and Olivér Ősz and Tibor Holczinger }, title = { Empirical Study of S-graph Approaches for Limited-Wait Storage Policy }, journal = { Information Society - Proceedings of MATCOS 2019 }, year = { 2019 }, volume = { 1 }, pages = { 43-46 }, url = { https://matcos.iam.upr.si/en/resources/files///is2019volumei---matcos.pdf }, }
Olivér Ősz , Balázs Ferenczi , Máté Hegyháti

Scheduling a forge with due dates and die deterioration

Annals of Operations Research, 2019 ,285, 353–367

10.1007/s10479-019-03336-6

BibTex for Osz2019 -

@ARTICLE{ Osz2019, author = { Olivér Ősz and Balázs Ferenczi and Máté Hegyháti }, title = { Scheduling a forge with due dates and die deterioration }, journal = { Annals of Operations Research }, year = { 2019 }, volume = { 285 }, pages = { 353–367 }, doi = { 10.1007/s10479-019-03336-6 }, url = { https://doi.org/10.1007/s10479-019-03336-6 }, }
Tibor Holczinger , Olivér Ősz , Máté Hegyháti

Scheduling approach for on‑site jobs of service providers

Flexible Services and Manufacturing Journal, 2019

10.1007/s10696-019-09359-2

BibTex for Holczinger2019 -

@ARTICLE{ Holczinger2019, author = { Tibor Holczinger and Olivér Ősz and Máté Hegyháti }, title = { Scheduling approach for on‑site jobs of service providers }, journal = { Flexible Services and Manufacturing Journal }, year = { 2019 }, volume = { }, pages = { }, doi = { 10.1007/s10696-019-09359-2 }, url = { https://doi.org/10.1007/s10696-019-09359-2 }, }
Máté Hegyháti , Olivér Ősz

Interlacing in cyclic scheduling

8th VOCAL Optimization Conference: Advanced Algorithms - Short papers, 2018

BibTex for Hegyhati2018c -

@ARTICLE{ Hegyhati2018c, author = { Máté Hegyháti and Olivér Ősz }, title = { Interlacing in cyclic scheduling }, journal = { 8th VOCAL Optimization Conference: Advanced Algorithms - Short papers }, year = { 2018 }, volume = { }, pages = { 50 – 55 }, }
Ádám Papp , Olivér Ősz , Máté Hegyháti

Review and comparison of MILP models for cyclic scheduling of robotic cells

8th VOCAL Optimization Conference: Advanced Algorithms - Short papers, 2018

BibTex for Papp2018 -

@ARTICLE{ Papp2018, author = { Ádám Papp and Olivér Ősz and Máté Hegyháti }, title = { Review and comparison of MILP models for cyclic scheduling of robotic cells }, journal = { 8th VOCAL Optimization Conference: Advanced Algorithms - Short papers }, year = { 2018 }, volume = { }, pages = { 79 – 84 }, }
Máté Hegyháti

Batch Process Scheduling with eS-graph: A Case Study

Chemical Engineering Transactions, 2018 ,70, 115 – 120

10.3303/CET1870020

BibTex for Hegyhati2018b -

@ARTICLE{ Hegyhati2018b, author = { Máté Hegyháti }, title = { Batch Process Scheduling with eS-graph: A Case Study }, journal = { Chemical Engineering Transactions }, year = { 2018 }, volume = { 70 }, pages = { 115 – 120 }, doi = { 10.3303/CET1870020 }, }
Olivér Ősz , Máté Hegyháti

An S-graph Based Approach for Multi-Mode Resource-Constrained Project Scheduling with Time-Varying Resource Capacities

Chemical Engineering Transactions, 2018 ,70, 1165 – 1170

10.3303/CET1870195

BibTex for Osz2018a -

@ARTICLE{ Osz2018a, author = { Olivér Ősz and Máté Hegyháti }, title = { An S-graph Based Approach for Multi-Mode Resource-Constrained Project Scheduling with Time-Varying Resource Capacities }, journal = { Chemical Engineering Transactions }, year = { 2018 }, volume = { 70 }, pages = { 1165 – 1170 }, doi = { 10.3303/CET1870195 }, }
Máté Hegyháti , Olivér Ősz , Miklós Hatwágner

A Study on Solving Single Stage Batch Process Scheduling Problems with an Evolutionary Algorithm Featuring Bacterial Mutations

Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science, 2018 ,10841, 386-394

10.1007/978-3-319-91253-0_36

BibTex for Hegyhati2018a -

@ARTICLE{ Hegyhati2018a, author = { Máté Hegyháti and Olivér Ősz and Miklós Hatwágner }, title = { A Study on Solving Single Stage Batch Process Scheduling Problems with an Evolutionary Algorithm Featuring Bacterial Mutations }, journal = { Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science }, year = { 2018 }, volume = { 10841 }, pages = { 386-394 }, doi = { 10.1007/978-3-319-91253-0_36 }, url = { https://doi.org/10.1007/978-3-319-91253-0_36 }, }
Máté Hegyháti

Modeling techniques for the eS-graph

Proceedings of the 16th International Conference on Project Management and Scheduling, 2018 ,39, 123 – 127

BibTex for Hegyhati2018 -

@ARTICLE{ Hegyhati2018, author = { Máté Hegyháti }, title = { Modeling techniques for the eS-graph }, journal = { Proceedings of the 16th International Conference on Project Management and Scheduling }, year = { 2018 }, volume = { 39 }, pages = { 123 – 127 }, }
Olivér Ősz , Máté Hegyháti

Scheduling a forge with due dates and die deterioration

Proceedings of the 16th International Conference on Project Management and Scheduling, 2018 ,39, 276 – 280

BibTex for Osz2018 -

@ARTICLE{ Osz2018, author = { Olivér Ősz and Máté Hegyháti }, title = { Scheduling a forge with due dates and die deterioration }, journal = { Proceedings of the 16th International Conference on Project Management and Scheduling }, year = { 2018 }, volume = { 39 }, pages = { 276 – 280 }, }
Balázs Dávid , Máté Hegyháti , Miklós Krész

Linearly Priced Timed Automata for the Bus Schedule Assignment Problem

Proceedings GOL'2018: The 4th IEEE International Conference On Logistics Operations Management, 2018

BibTex for David2018 -

@ARTICLE{ David2018, author = { Balázs Dávid and Máté Hegyháti and Miklós Krész }, title = { Linearly Priced Timed Automata for the Bus Schedule Assignment Problem }, journal = { Proceedings GOL'2018: The 4th IEEE International Conference On Logistics Operations Management }, year = { 2018 }, volume = { }, pages = { 430 – 436 }, }
Máté Hegyháti , Olivér Ősz , Balázs Kovács , Ferenc Friedler

Scheduling of Automated Wet-Etch Stations

Chemical Engineering Transactions, 2014 ,39, 433 – 438

10.3303/CET1439073

BibTex for Hegyhati2014 -

@ARTICLE{ Hegyhati2014, author = { Máté Hegyháti and Olivér Ősz and Balázs Kovács and Ferenc Friedler }, title = { Scheduling of Automated Wet-Etch Stations }, journal = { Chemical Engineering Transactions }, year = { 2014 }, volume = { 39 }, pages = { 433 – 438 }, doi = { 10.3303/CET1439073 }, }
W.P.Q. Ng , P.S. Varbanov , J.J. Klemeš , M. Hegyháti , B. Bertók , I. Heckl , H.L. Lam

Waste to energy for small cities: Economics versus carbon footprint

Chemical Engineering Transactions, 2013 ,35, 889 – 894

10.3303/CET1335148

BibTex for Ng2013 -

@ARTICLE{ Ng2013, author = { W.P.Q. Ng and P.S. Varbanov and J.J. Klemeš and M. Hegyháti and B. Bertók and I. Heckl and H.L. Lam }, title = { Waste to energy for small cities: Economics versus carbon footprint }, journal = { Chemical Engineering Transactions }, year = { 2013 }, volume = { 35 }, pages = { 889 – 894 }, abstract = { The main activities in Waste to Energy processing include waste generation, collection, separation, transportation, conversion, energy distribution, and ultimate waste disposal. Waste to Energy carries a trade-off between energy generation and the energy spent on collection, transport and treatment. Major performance indicators are cost, Waste Energy Potential Utilisation, and Carbon Footprint. This presentation analyses the potential of small cities to substitute part of their fossil fuels use by energy derived from Municipal Solid Waste. Several factors are considered in the study. The impact of waste logistics and the losses from energy distribution systems - natural gas pipeline and electricity grid are the most significant ones on the side of the supply chain. Further, the waste processing part, including the energy recovery from the waste involves the evaluation of a number of technologies linked with each other to form a distributed integrated processing system. In this study, the options for converting waste into thermal energy include (a) biogas digestion and burning and (b) waste incineration with off-gas cleaning. It is also possible to use the biogas in advanced cogeneration systems based on engines or fuel cells. The proposed procedure takes all these options into account and derives the optimal processing configuration from the waste generation to energy supply and residual waste deposition to landfill. }, doi = { 10.3303/CET1335148 }, }
M. Hegyháti , Z. Tuza

Colorability of mixed hypergraphs and their chromatic inversions

Journal of Combinatorial Optimization, 2013 ,25(4), 737 – 751

10.1007/s10878-012-9559-7

BibTex for Hegyhati2013 -

@ARTICLE{ Hegyhati2013, author = { M. Hegyháti and Z. Tuza }, title = { Colorability of mixed hypergraphs and their chromatic inversions }, journal = { Journal of Combinatorial Optimization }, year = { 2013 }, volume = { 25 }, pages = { 737 – 751 }, issue = { 4 }, abstract = { We solve a long-standing open problem concerning a discrete mathematical model, which has various applications in computer science and several other fields, including frequency assignment and many other problems on resource allocation. A mixed hypergraph H is a triple (X,C,D) where X is the set of vertices, and C and D are two set systems over X, the families of so-called C-edges and D-edges, respectively. A vertex coloring of a mixed hypergraph H is proper if every C-edge has two vertices with a common color and every D-edge has two vertices with different colors. A mixed hypergraph is colorable if it has at least one proper coloring; otherwise it is uncolorable. The chromatic inversion of a mixed hypergraph H = (X,C,D) is defined as Hc = (X,C,D). Since 1995, it was an open problem wether there is a correlation between the colorability properties of a hypergraph and its chromatic inversion. In this paper we answer this question in the negative, proving that there exists no polynomial-time algorithm (provided that P ≠ NP to decide whether both H and Hc are colorable, or both are uncolorable. This theorem holds already for the restricted class of 3-uniform mixed hypergraphs (i.e., where every edge has exactly three vertices). The proof is based on a new polynomial-time algorithm for coloring a special subclass of 3-uniform mixed hypergraphs. Implementation in C++ programming language has been tested. Further related decision problems are investigated, too. 2012 Springer Science+Business Media New York. }, doi = { 10.1007/s10878-012-9559-7 }, }
A. Nemet , M. Hegyháti , J.J. Klemeš , F. Friedler

Increasing solar energy utilisation by rescheduling operations with heat and electricity demand

Chemical Engineering Transactions, 2012 ,29, 1483 – 1488

10.3303/CET1229248

BibTex for Nemet2012 -

@ARTICLE{ Nemet2012, author = { A. Nemet and M. Hegyháti and J.J. Klemeš and F. Friedler }, title = { Increasing solar energy utilisation by rescheduling operations with heat and electricity demand }, journal = { Chemical Engineering Transactions }, year = { 2012 }, volume = { 29 }, pages = { 1483 – 1488 }, abstract = { For the utilization of renewables, e.g., solar energy, two systems are possible, i.e., direct transfer from the capture system to the process and indirect from capture system through storage to the process with demand. Direct usage is preferable because of its higher efficiency. Mathematical programming for the rescheduling of the operations was used to maximize the direct use of renewable energy and to minimize the need for the energy storage. This reduces the consumption of utilities with a higher impact on the environment by exploiting an inherent flexibility of the processes on the demand side. Some operations can be shifted in time if the site has enough of a certain resource in stock. A flexible operation can also be rescheduled. However, the size of the stock implies a limitation for the shifting in time. The optimal solution of the operational level depends on the design parameters. A retrofit sensitivity analysis where the optimal schedule has been identified for different design conditions has been developed. }, doi = { 10.3303/CET1229248 }, }
T. Holczinger , M. Hegyháti , F. Friedler

Simultaneous heat integration and batch process scheduling

Chemical Engineering Transactions, 2012 ,29, 337 – 342

10.3303/CET1229057

BibTex for Holczinger2012 -

@ARTICLE{ Holczinger2012, author = { T. Holczinger and M. Hegyháti and F. Friedler }, title = { Simultaneous heat integration and batch process scheduling }, journal = { Chemical Engineering Transactions }, year = { 2012 }, volume = { 29 }, pages = { 337 – 342 }, abstract = { Heat integration of continuous processes is a widely studied research area, where many approaches have been developed to minimize cold and hot utility usage. Batch processes require additional consideration for the planning of the heat exchanger network: since the flows are not always present in the system, their timing has to be considered as well. Both heat integration and scheduling of batch processes are highly complex, their combination is expected to be even higher. Several papers have already addressed the integrated problem in the last decade (Majozi, 2006, Chen and Chang, 2009, Halim and Srinivasan, 2011). Adonyi et. al. (2003) has presented an algorithm to minimize the utility usage for a given time horizon. Their approach assumed, however, that heat exchangers are present for all of the hot-cold stream pairs. Moreover, each hot or cold stream was allowed to be matched with only one hot or cold stream, respectively, further heat demands of the stream had to be satisfied from utilities. The aim of this work is to present an extension of Adonyi et. al.’s approach by allowing the streams to have heat exchanges with multiple other streams. The newly presented approach also takes into account the limitation on the number of availab heat exchangers and their scheduling. }, doi = { 10.3303/CET1229057 }, }
Mate Hegyhati , Ferenc Friedler

The role of energy consumption in batch process scheduling

Computer Aided Chemical Engineering, 2011 ,29, 1979 – 1983

10.1016/B978-0-444-54298-4.50174-4

BibTex for Hegyhati2011b -

@ARTICLE{ Hegyhati2011b, author = { Mate Hegyhati and Ferenc Friedler }, title = { The role of energy consumption in batch process scheduling }, journal = { Computer Aided Chemical Engineering }, year = { 2011 }, volume = { 29 }, pages = { 1979 – 1983 }, abstract = { Makespan minimization or throughput maximization, the most common objectives in batch process scheduling are related to economical aspects; energy consumption or sustainability are not directly taken into account (\[Mendez et al., 2006\] and \[Hegyhati and Friedler, 2010\]). Some of the published methods consider utility cost (Adonyi et al., 2003) or wastewater minimization (Halim and Srinivasan, 2010) during the optimization in addition to economical aspects, nevertheless, the overall energy requirements of a process have never been taken into account. In the present work, a scheduling method is proposed that also considers the energy demands of transfer of liquid materials. In the available mathematical models transfer of intermediate materials has impact only on the overall processing time, and does not express the energy consumption of the transfer. Transfer time of intermediate materials is usually regarded as a fixed value, however, there is an energy -time tradeoff for pumping of intermediate, raw, or product materials. The energy cost of transfer depends on the height difference between the source and destination, the cross-section area of the pipe, viscosity of the material, and the available time. The proposed method integrates pumping strategies into the general scheduling problem to tackle the transfer energy demands. Although this energy is much smaller in magnitude compared to the usual heat energy requirements, still, it is worth investing effort in its reduction, since it is in the form of electrical energy. }, doi = { 10.1016/B978-0-444-54298-4.50174-4 }, }
Mate Hegyhati , Tibor Holczinger , András Andras Szoldatics , Ferenc Friedler

Combinatorial Approach to Address Batch Scheduling Problems with Limited Storage Time

Chemical Engineering Transactions, 2011 ,25, 495 – 500

10.3303/CET1125083

BibTex for Hegyhati2011a -

@ARTICLE{ Hegyhati2011a, author = { Mate Hegyhati and Tibor Holczinger and András Andras Szoldatics and Ferenc Friedler }, title = { Combinatorial Approach to Address Batch Scheduling Problems with Limited Storage Time }, journal = { Chemical Engineering Transactions }, year = { 2011 }, volume = { 25 }, pages = { 495 – 500 }, abstract = { }, doi = { 10.3303/CET1125083 }, }
Máté Hegyháti , Ferenc Friedler

Combinatorial Algorithms of the S-Graph Framework for Batch Scheduling

Industrial & Engineering Chemistry Research, 2011 ,50(9), 5169 – 5174

10.1007/s10098-009-0240-5

BibTex for Hegyhati2011 -

@ARTICLE{ Hegyhati2011, author = { Máté Hegyháti and Ferenc Friedler }, title = { Combinatorial Algorithms of the S-Graph Framework for Batch Scheduling }, journal = { Industrial & Engineering Chemistry Research }, year = { 2011 }, volume = { 50 }, pages = { 5169 – 5174 }, issue = { 9 }, abstract = { Methods for solving batch process scheduling problems have gone through a vast development in the last 2 decades. Most of the published approaches are based on a mixed integer programming formulation. Since the difficulty of scheduling is originated from its combinatorial nature, graphs and combinatorial algorithms are more adequate to represent and solve the problem. Although, combinatorial algorithms and data structures have an enormous literature, these algorithms can not be directly applied to scheduling and further elaboration is needed. In the present work, the combinatorial nature of batch scheduling problems is analyzed. Several combinatorial algorithms are listed that can be considered for the scheduling of batch processes. Their proper adaptation is illustrated via the S-graph framework, in which the main emphasis lies on the combinatorial tools. Furthermore, Place Petri Nets and Timed Automata are also briefly described. An S-graph algorithm has been extensively compared with well-known MILP formulations. }, doi = { 10.1007/s10098-009-0240-5 }, }
José Miguel Laínez , Máté Hegyháti , Ferenc Friedler , Luis Puigjaner

Using S-graph to address uncertainty in batch plants

Clean Technologies and Environmental Policy, 2011 ,12(2), 105 – 115

10.1007/s10098-009-0240-5

BibTex for Lainez2010 -

@ARTICLE{ Lainez2010, author = { José Miguel Laínez and Máté Hegyháti and Ferenc Friedler and Luis Puigjaner }, title = { Using S-graph to address uncertainty in batch plants }, journal = { Clean Technologies and Environmental Policy }, year = { 2011 }, volume = { 12 }, pages = { 105 – 115 }, issue = { 2 }, abstract = { Abstract Processes and markets uncertainties make batch plants a complex environment to manage production activities. Uncertainties may cause deviations and infeasibilities in predefined schedules; this may result in poor planning and inefficient utilization of materials. Consequently, the relevance of explicitly incorporating variability in the scheduling formulation in order to offer more efficient plans and robust decisions to changes has become recognized. This work addresses the batch plants scheduling under exogenous uncertainty. The most widely utilized approach to tackle this problem is stochastic programming; however its solution results in high computational expenses. From another standpoint S-graph, a graph-theoretic approach, has proved to be very efficient to deal with deterministic scheduling. In this work, the S-graph framework is enhanced so that stochastic scheduling problems can be handled. For this purpose, a LP model that is used as performance evaluator has been coupled with S-graph framework. One of the main advantages of the proposed approach is that the search space does not increase according to the number of scenarios considered in the problem. Finally, the potential of the proposed framework is highlighted through two illustrative examples. }, doi = { 10.1007/s10098-009-0240-5 }, }
Mate Hegyhati , Ferenc Friedler

Overview of Industrial Batch Process Scheduling

Chemical Engineering Transactions, 2010 ,21, 895 – 900

10.3303/CET1021150

BibTex for Hegyhati2010 -

@ARTICLE{ Hegyhati2010, author = { Mate Hegyhati and Ferenc Friedler }, title = { Overview of Industrial Batch Process Scheduling }, journal = { Chemical Engineering Transactions }, year = { 2010 }, volume = { 21 }, pages = { 895 – 900 }, abstract = { The operation of a production facility has a major effect on the efficiency; therefore it is of upmost importance to find the best possible schedule. Due to the high practical expediency, the topic of batch process scheduling has gained growing interest in the last two decades and many approaches have been published to solve a wide variety of scheduling problems. In the present work first the different type of batch scheduling problems are overviewed, then the advantages and disadvantages of the available methods for batch process scheduling are summarized. }, doi = { 10.3303/CET1021150 }, }
M. Hegyháti , T. Majozi , T. Holczinger , F. Friedler

Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods

Chemical Engineering Science, 2009 ,64(3), 605 – 610

10.1016/j.ces.2008.10.018

BibTex for Hegyhati2009 -

@ARTICLE{ Hegyhati2009, author = { M. Hegyháti and T. Majozi and T. Holczinger and F. Friedler }, title = { Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods }, journal = { Chemical Engineering Science }, year = { 2009 }, volume = { 64 }, pages = { 605 – 610 }, issue = { 3 }, abstract = { Multipurpose batch processes entail various operational policies that have been widely investigated in published literature. In this paper, no-intermediate-storage (NIS), zero-wait (ZW) and common-intermediate-storage (CIS) operational policies are of particular interest. In all these policies, no dedicated storage facility is available between two consecutive units. Unlike the other operational policies, these particular policies bear some subtle practical infeasibility that has gone unnoticed in literature. In essence, this infeasibility has been reported as optimal, thus assumed to be feasible, by various authors using mathematical programming techniques. It pertains to a unit transferring product to one or more units whilst simultaneously receiving feed from another, which is practically infeasible and as such need not be considered as a possible solution. This feature is particularly conspicuous in batch processes with complex recipes wherein production paths can be in opposite directions. This paper presents the unique feature of the S-graph framework to isolate cross-transfer during optimization, whereas the available mathematical programming methods inherently fail neither to detect nor to eliminate this infeasibility. A few examples taken from published literature are presented for demonstration purposes. }, doi = { 10.1016/j.ces.2008.10.018 }, }
Tibor Holczinger , Thokozani Majozi , Mate Hegyhati , Ferenc Friedler

An automated algorithm for throughput maximization under fixed time horizon in multipurpose batch plants: S-Graph approach

Computer Aided Chemical Engineering, 2007 ,24, 649 – 654

10.1016/S1570-7946(07)80131-3

BibTex for Holczinger2007 -

@ARTICLE{ Holczinger2007, author = { Tibor Holczinger and Thokozani Majozi and Mate Hegyhati and Ferenc Friedler }, title = { An automated algorithm for throughput maximization under fixed time horizon in multipurpose batch plants: S-Graph approach }, journal = { Computer Aided Chemical Engineering }, year = { 2007 }, volume = { 24 }, pages = { 649 – 654 }, abstract = { This paper presents a graph-theoretic technique for scheduling of multipurpose batch processes with the objective of maximizing throughputover a fixed time horizon. The presented technique is based on the S-graph framework which embeds the necessary scheduling information pertaining to recipes of different batches and possible resource allocation. The distinct feature of this contribution is the irrelevance of time horizon discretization which has become traditional in most mathematical programming techniques. Consequently, no presupposition of time points is required, thereby rendering the technique truly continuous in time. A comparison withtime point based techniques is conducted to demonstrate the performance. }, doi = { 10.1016/S1570-7946(07)80131-3 }, }

Conference presentations & posters 58

new Cyclic scheduling with Timed Automata - Hegyhati, M.

SWORDS 2023 - Szeged, Hungary - Nov 24, 2023
new Why implementation matters for graph algorithms? - Hegyhati, M., Zs. Tuza

OPAL - Veszprem, Hungary - Jun 6, 2023
new Decision Support for Investments in Freshwater Usage Minimization of Production Processes with Integrated Scheduling Methods - Ősz, O., M. Hegyhati

MTU-SEN-22 - Sopron, Hungary - Nov 3, 2022
new Systematic generation of precedence based MILP models with P-graphs for multipurpose scheduling problems - Hegyhati M.

MATCOS-22 - Koper, Slovenia - Oct 13-14, 2022
new Long-term plant-level scheduling with uncertainty in the plywood industry - Ősz, O., B. Dávid, J. Garab, M. Hegyhati

Hardwood '22 - Sopron, Hungary - Oct 12-14, 2022
Scheduling of Waste Wood Processing Facilities with Overlapping Jobs - Dávid, B., O. Ősz, M. Hegyhati

SOR '21 - Bled, Slovenia - Sept 22-24, 2021
Improving solution performance of the S-graph scheduling framework - Ősz, O., M. Hegyhati

ECCO 2021 - Madrid, Spain - Jun 10 - Jun 11, 2021
Energy usage minimization with the S-graph framework - Ősz, O., M. Hegyhati

MATCOS-19 - Koper, Slovenia - Oct 10-11, 2019
Empirical Study of S-graph Approaches for Limited-Wait Storage Policy - Hegyhati, M, O. Ősz, T. Holczinger

MATCOS-19 - Koper, Slovenia - Oct 10-11, 2019
A novel MILP model for cyclic scheduling with interlacing - Ősz, O., M. Hegyhati

ECCO 2019 - St. Julian's, Malta - May 30 - June 1, 2019
Interlacing in cyclic scheduling - Hegyhati, M, O. Ősz

VOCAL 2018 - Esztergom, Hungary - Dec 10-12, 2018
Review and comparison of MILP models for cyclic scheduling of robotic cells - Papp, Á., O. Ősz, M. Hegyhati

VOCAL 2018 - Esztergom, Hungary - Dec 10-12, 2018
Recent developments on the soiling simulation of solar power plants - Merrouni, A. A., M. Hegyhati

2nd SPIL - Brno, Czech Republic - Aug 30-31, 2018
Production scheduling of resources with varying availability - Osz O., M. Hegyhati

2nd SPIL - Brno, Czech Republic - Aug 30-31, 2018
Batch Process Scheduling with eS-graph: A Case Study - M. Hegyhati

PRES/CHISA 2018 - Prague, Czech Republic - Aug 26-29, 2018
An S-graph Based Approach for Multi-Mode Resource-Constrained Project Scheduling with Time-Varying Resource Capacites - Osz O., M. Hegyhati

PRES/CHISA 2018 - Prague, Czech Republic - Aug 26-29, 2018
A study on solving single stage batch process scheduling problems with an evolutionary algorithm featuring bacterial mutations - Hegyhati M., O. Osz, M. Hatwágner

ICAISC 2018 - Zakopane, Poland - Jun 3-7, 2018
Linearly Priced Timed Automata for the Bus Schedule Assignment Problem - Dávid B., M. Hegyháti, M. Krész

GOL 2018 - Le Havre, France - April 10-12, 2018
Modeling techniques for the eS-graph - Hegyhati, M.

PMS 2018 - Rome, Italy - Apr 17-20, 2018
Scheduling a forge with due dates and die deterioration - Osz O., M. Hegyhati

PMS 2018 - Rome, Italy - Apr 17-20, 2018
Evaluation of Cleaning Strategies for Solar Power Plants in Eastern Morocco - Merrouni A. A., A. Mezrhab, M. Hegyhati

1st SPIL - Brno, Czech Republic - Dec 6-7, 2017
Scheduling of Mobile Workflows with S-graph - Holczinger T., O. Ősz, M. Hegyhati

SPIL 2017 - Brno, Czech Republic - Dec 6-7, 2017
Timed Automata based scheduling of automated wet-etch stations - Hegyhati, M.

ECCO 2017 - Koper, Slovenia - May 3-6, 2017
Combinatorial approach for the multi-mode resource-constrained project scheduling problem - Osz, O., M . Hegyhati

ECCO 2017 - Koper, Slovenia - May 3-6, 2017
S-graph based reactive scheduling - Hegyhati, M., Z. Nemes

VOCAL 2016 - Esztergom, Hungary - December 12-15, 2016
A novel combinatorial approach for the resource-constrained scheduling problem - Osz, O., M. Hegyhati M.

VOCAL 2016 - Esztergom, Hungary - December 12-15, 2016
A combinatorial modeling tool for event-based batch process scheduling: the eS-graph - Hegyhati, M.

ASCONIKK & VOCAL 2014 - Veszprem, Hungary - December 14-17, 2014
Generic software tool for the evaluation, comparison and ranking of methods for short-term batch process scheduling problems - Hegyhati, M., A. Eles

ASCONIKK & VOCAL 2014 - Veszprem, Hungary - December 14-17, 2014
Combinatorial approach for the scheduling of Automated Wet-etch Stations - Osz, O., B. Kovacs, M. Hegyhati

ASCONIKK & VOCAL 2014 - Veszprem, Hungary - December 14-17, 2014
Handling Limited Wait and Zero Wait policies with the S-graph framework - Toth, B., M. Hegyhati

ASCONIKK & VOCAL 2014 - Veszprem, Hungary - December 14-17, 2014
Scheduling of automated wet-etch stations - Hegyhati, M., O. Osz, B. Kovacs, F. Friedler

CHISA/PRES 2014 - Prague, Czech Republic - August 23-27, 2014
Waste to Energy for Small Cities: Economics vs. Carbon Footprints - Ng, W. Q. P., P. S. Varbanov. J. J. Klemes, M. Hegyhati, B. Bertok, I. Heckl, H. L. Lam

PRES '13 - Rhodos, Greece - September 29 - October 2, 2013
The effect of cleaning strategies of CSP mirrors on the efficiency and water footprint of solar power plants - Hegyhati, M., A. A. Merrouni, F. Wolferstetter, A. Mrezhrab, F. Friedler

SDEWES 2013 - Dubrovnik, Croatia - September 22-27, 2013
Graph based approaches for scheduling trains in railway networks - Hegyhati M., O. Osz, F. Friedler

InnoRail 2013 - Budapest, Hungary - Oct 28-30, 2013
Combinatorial Tool for Cyclic Scheduling of Batch Processes: S-graph Approach - Hegyháti, M., A. Szoldatics, O. Ősz, F. Friedler

VOCAL 2012 - Veszprém, Hungary - December 11-14, 2012
Empirical Analysis of Methods and Software Tools for Batch Process Scheduling - Éles A., B. Kovács, B. Tóth, M. Hegyháti

VOCAL 2012 - Veszprém, Hungary - Dec 11-14, 2012
Simultaneous heat integration and batch process scheduling - Holczinger, T., M. Hegyhati, F. Friedler

CHISA/PRES 2012 - Prague, Czech Republic - August 25-29, 2012
Increasing solar energy utilisation by rescheduling operations with heat and electricity demand - Nemet, A., M. Hegyháti, J. K. Klemeš, F. Friedler

CHISA/PRES 2012 - Prague, Czech Republic - August 25-29, 2012
Modeling issues of mathematical programming based approaches in batch process scheduling - Hegyháti, M., A. Éles, F. Friedler

PRES 2012 - Prague, Czech Republic - Aug 25-29, 2012
Cyclic scheduling of batch processes: S-graph algorithm - Hegyháti, M., A. Szoldatics, F. Friedler

PRES 2012 - Prague, Czech Republic - Aug 25-29, 2012
Increasing solar energy utilisation by rescheduling operations with heat and electricity demand - Nemet, A., M. Hegyhati, J. J. Klemeš, F. Friedler

SDEWES 2012 - Ohrid, Macedonia - July 1-7, 2012
Tools of Discrete Event Systems for Batch Process Scheduling - Hegyháti, M., F. Friedler

CAPE 2012 - Veszprém, Hungary - March 26-28, 2012
In-Depth Study and Comparison of S-Graph Framework and Precedence Based MILP Formulations for Batch Process Scheduling - Hegyháti, M., T. Holczinger, F. Friedler

AIChE AM 2011 - Minneapolis, USA - October 16-21, 2011
The role of energy consumption in batch process scheduling - Hegyhati, M., F. Friedler

ESCAPE 21 - Chalkidiki, Greece - May 29 - June 1, 2011
Combinatorial Approach to Address Batch Scheduling Problems with Limited Storage Time - Hegyhati, M., T. Holczinger, A. Szoldatics, F. Friedler

PRES'11 - Florence, Italy - May 8-11, 2011
S-graph as an integrated modelling and optimization tool for the scheduling of industrial batch processes - Holczinger, T. ,M. Hegyhati, F. Friedler

VOCAL 2010 - Veszprem, Hungary - December 13-15, 2010
Overview of industrial batch process scheduling - Hegyhati, M., F. Friedler

CHISA/PRES 2010 - Prague, Czech Republic - August 29 - September 1, 2010
Preemptive optimization of chemical batch processes with continuous external uncertainties based on a novel S-graph branching strategy - Hegyhati, M., J. M. Lainez, L. Puigjaner, F. Friedler

PRES 2010 - Prague, Czech Republic - August 29 - September 1, 2010
Practical feasibility of mathematical models in scheduling - Hegyhati, M., T. Majozi, T. Holczinger, F. Friedler

VOCAL 2008 - Veszprem, Hungary - December 15-17, 2008
Throughput maximization in a multipurpose batch plant - Hegyhati, M., T. Majozi, F. Friedler

CHISA/PRES 2008 - Prague, Czech Republic - August 24-28, 2008
Using S-graph to address uncertainty in batch plants - Laínez, J., M. Hegyhati, L. Pugjaner, F. Friedler

PRES 2008 - Prague, Czech Republic - August 24-28, 2008
S-graph based continuous-time approach for throughput maximization in multipurpose batch plants - Majozi, T., F. Friedler, T. Holczinger, M. Hegyhati

IFORS 2008 - Johannesburg, South Africa - July 13-18, 2008
Colorability of mixed hypergraphs and their chromatic inverses - Hegyhati M., Z. Tuza

CID 2007 - Karpacz, Poland - September 16-21, 2007
Transforming STN based scheduling problems to S-graph representation - Hegyhati, M., T. Holczinger, T. Majozi, F. Friedler

PCCPE 2007 - Rzeszów, Poland - September 3-7, 2007
Throughput Maximization in Multipurpose Batch Plants: S-graph vs Time Point Based Methods - Holczinger, T.,T. Majozi, M. Hegyhati, F. Friedler

PRES'07 - Ischia Island, Italy - June 24-27, 2007
An Automated Algorithm for Throughput Maximization Under Fixed Time Horizon in Multipurpose Batch Plants: S-Graph Approach - Holczinger, T.,T. Majozi, M. Hegyhati, F. Friedler

ESCAPE 17 - Bucharest, Romania - May 27-30, 2007
Using S-graph for Throughput Maximization in Multipurpose Batch Plants - Holczinger, T.,T. Majozi, M. Hegyhati, F. Friedler

VOCAL 2006 - Veszprem, Hungary - December 12-15, 2006
Demonstration program for S-graph based batch-process scheduling - Hegyhati, M., R. Adonyi, T. Holczinger, F. Friedler

PRES 2006 - Prague, Czech Republic - August 27-31, 2006

List of Publications & Graduated Ph.D. students

Graduated Ph.D. students

Publications

Journal articles & short papers31

BibTex for Hegyhati2023 - Copy to clipboard

BibTex for Osz2023 - Copy to clipboard

BibTex for Hegyhati2022 - Copy to clipboard

BibTex for David2021b - Copy to clipboard

BibTex for David2021 - Copy to clipboard

BibTex for Osz2020 - Copy to clipboard

BibTex for Hegyhati2020 - Copy to clipboard

BibTex for Osz2019a - Copy to clipboard

BibTex for Hegyhati2019 - Copy to clipboard

BibTex for Osz2019 - Copy to clipboard

BibTex for Holczinger2019 - Copy to clipboard

BibTex for Hegyhati2018c - Copy to clipboard

BibTex for Papp2018 - Copy to clipboard

BibTex for Hegyhati2018b - Copy to clipboard

BibTex for Osz2018a - Copy to clipboard

BibTex for Hegyhati2018a - Copy to clipboard

BibTex for Hegyhati2018 - Copy to clipboard

BibTex for Osz2018 - Copy to clipboard

BibTex for David2018 - Copy to clipboard

BibTex for Hegyhati2014 - Copy to clipboard

BibTex for Ng2013 - Copy to clipboard

BibTex for Hegyhati2013 - Copy to clipboard

BibTex for Nemet2012 - Copy to clipboard

BibTex for Holczinger2012 - Copy to clipboard

BibTex for Hegyhati2011b - Copy to clipboard

BibTex for Hegyhati2011a - Copy to clipboard

BibTex for Hegyhati2011 - Copy to clipboard

BibTex for Lainez2010 - Copy to clipboard

BibTex for Hegyhati2010 - Copy to clipboard

BibTex for Hegyhati2009 - Copy to clipboard

BibTex for Holczinger2007 - Copy to clipboard

Conference presentations & posters 58

BibTex for `Hegyhati2023` -

BibTex for `Osz2023` -

BibTex for `Hegyhati2022` -

BibTex for `David2021b` -

BibTex for `David2021` -

BibTex for `Osz2020` -

BibTex for `Hegyhati2020` -

BibTex for `Osz2019a` -

BibTex for `Hegyhati2019` -

BibTex for `Osz2019` -

BibTex for `Holczinger2019` -

BibTex for `Hegyhati2018c` -

BibTex for `Papp2018` -

BibTex for `Hegyhati2018b` -

BibTex for `Osz2018a` -

BibTex for `Hegyhati2018a` -

BibTex for `Hegyhati2018` -

BibTex for `Osz2018` -

BibTex for `David2018` -

BibTex for `Hegyhati2014` -

BibTex for `Ng2013` -

BibTex for `Hegyhati2013` -

BibTex for `Nemet2012` -

BibTex for `Holczinger2012` -

BibTex for `Hegyhati2011b` -

BibTex for `Hegyhati2011a` -

BibTex for `Hegyhati2011` -

BibTex for `Lainez2010` -

BibTex for `Hegyhati2010` -

BibTex for `Hegyhati2009` -

BibTex for `Holczinger2007` -