Péter Györgyi

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 18

Top Topics

Top Venues

Eur. J. Oper. Res.

Ann. Oper. Res.

Publications

David Fischer, Péter Györgyi
Approximation algorithms for coupled task scheduling minimizing the sum of completion times. Ann. Oper. Res. 328 (2) (2023)
Péter Györgyi, Tamás Kis, Tímea Tamási
An online joint replenishment problem combined with single machine scheduling. J. Comb. Optim. 45 (5) (2023)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26 (4) (2023)
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
Joint replenishment meets scheduling. J. Sched. 26 (1) (2023)
Péter Györgyi, Tamás Kis, Tímea Tamási
An online joint replenishment problem combined with single machine scheduling. CoRR (2022)
Péter Györgyi, Tamás Kis
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. 311 (2022)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI (2021)
Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis
Suboptimal and conflict-free control of a fleet of AGVs to serve online requests. Comput. Ind. Eng. 152 (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR (2021)
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
Joint replenishment meets scheduling. CoRR (2021)
Péter Györgyi, Tamás Kis
A common approximation framework for early work, late work, and resource leveling problems. Eur. J. Oper. Res. 286 (1) (2020)
Péter Györgyi, Tamás Kis
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs. CoRR (2019)
Péter Györgyi, Tamás Kis
A probabilistic approach to pickup and delivery problems with time window uncertainty. Eur. J. Oper. Res. 274 (3) (2019)
Péter Györgyi, Tamás Kis
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Sched. 22 (6) (2019)
Péter Györgyi, Tamás Kis
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut. Comput. Ind. Eng. 115 (2018)
Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak
On the number of touching pairs in a set of planar curves. Comput. Geom. 67 (2018)
Péter Györgyi, Tamás Kis
Approximation schemes for parallel machine scheduling with non-renewable resources. Eur. J. Oper. Res. 258 (1) (2017)
Péter Györgyi
A PTAS for a resource scheduling problem with arbitrary number of parallel machines. Oper. Res. Lett. 45 (6) (2017)
Péter Györgyi, Tamás Kis
Approximability of scheduling problems with resource consuming jobs. Ann. Oper. Res. 235 (1) (2015)
Péter Györgyi, Tamás Kis
Reductions between scheduling problems with non-renewable resources and knapsack problems. Theor. Comput. Sci. 565 (2015)
Péter Györgyi, Tamás Kis
Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17 (2) (2014)