Péter Györgyi

23 papers A* 1Journal 22
YearRankTypeTitle / Venue / Authors
2025 J jnl
On variants of a load-balancing problem with unit-load jobs.
J. Sched.
Péter Györgyi, Tamás Kis, Evelin Szögi
2025 J jnl
Reactive scheduling of uncertain jobs with maximum time lags.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis, Evelin Szögi
2023 J jnl
A multivariate complexity analysis of the material consumption scheduling problem.
J. Sched.
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2023 J jnl
An online joint replenishment problem combined with single machine scheduling.
J. Comb. Optim.
Péter Györgyi, Tamás Kis, Tímea Tamási
2023 J jnl
Approximation algorithms for coupled task scheduling minimizing the sum of completion times.
Ann. Oper. Res.
David Fischer, Péter Györgyi
2023 J jnl
Joint replenishment meets scheduling.
J. Sched.
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2022 J jnl
An online joint replenishment problem combined with single machine scheduling.
CoRR
Péter Györgyi, Tamás Kis, Tímea Tamási
2022 J jnl
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints.
Discret. Appl. Math.
Péter Györgyi, Tamás Kis
2021 A* conf
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.
AAAI
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021 J jnl
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.
CoRR
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021 J jnl
Joint replenishment meets scheduling.
CoRR
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2021 J jnl
Suboptimal and conflict-free control of a fleet of AGVs to serve online requests.
Comput. Ind. Eng.
Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis
2020 J jnl
A common approximation framework for early work, late work, and resource leveling problems.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2019 J jnl
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.
CoRR
Péter Györgyi, Tamás Kis
2019 J jnl
A probabilistic approach to pickup and delivery problems with time window uncertainty.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2019 J jnl
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.
J. Sched.
Péter Györgyi, Tamás Kis
2018 J jnl
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Comput. Ind. Eng.
Péter Györgyi, Tamás Kis
2018 J jnl
On the number of touching pairs in a set of planar curves.
Comput. Geom.
Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak
2017 J jnl
A PTAS for a resource scheduling problem with arbitrary number of parallel machines.
Oper. Res. Lett.
Péter Györgyi
2017 J jnl
Approximation schemes for parallel machine scheduling with non-renewable resources.
Eur. J. Oper. Res.
Péter Györgyi, Tamás Kis
2015 J jnl
Approximability of scheduling problems with resource consuming jobs.
Ann. Oper. Res.
Péter Györgyi, Tamás Kis
2015 J jnl
Reductions between scheduling problems with non-renewable resources and knapsack problems.
Theor. Comput. Sci.
Péter Györgyi, Tamás Kis
2014 J jnl
Approximation schemes for single machine scheduling with non-renewable resource constraints.
J. Sched.
Péter Györgyi, Tamás Kis