| Approximation schemes for parallel machine scheduling with non-renewable resources P Györgyi, T Kis European Journal of Operational Research 258 (1), 113-123, 2017 | 33 | 2017 |
| Approximation schemes for single machine scheduling with non-renewable resource constraints P Györgyi, T Kis Journal of Scheduling 17, 135-144, 2014 | 32 | 2014 |
| A probabilistic approach to pickup and delivery problems with time window uncertainty P Györgyi, T Kis European Journal of Operational Research 274 (3), 909-923, 2019 | 26 | 2019 |
| Approximability of scheduling problems with resource consuming jobs P Györgyi, T Kis Annals of Operations Research 235 (1), 319-336, 2015 | 26 | 2015 |
| Reductions between scheduling problems with non-renewable resources and knapsack problems P Györgyi, T Kis Theoretical Computer Science 565, 63-76, 2015 | 18 | 2015 |
| A PTAS for a resource scheduling problem with arbitrary number of parallel machines P Györgyi Operations Research Letters 45 (6), 604-609, 2017 | 13 | 2017 |
| Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints P Györgyi, T Kis Journal of Scheduling, 2019 | 12 | 2019 |
| Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut P Györgyi, T Kis Computers & Industrial Engineering 115, 220-225, 2018 | 12 | 2018 |
| Suboptimal and conflict-free control of a fleet of AGVs to serve online requests M Drótos, P Györgyi, M Horváth, T Kis Computers & Industrial Engineering 152, 106999, 2021 | 9 | 2021 |
| A common approximation framework for early work, late work, and resource leveling problems P Györgyi, T Kis European Journal of Operational Research 286 (1), 129-137, 2020 | 9 | 2020 |
| New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints P Györgyi, T Kis Discrete Applied Mathematics 311, 97-109, 2022 | 5 | 2022 |
| A multivariate complexity analysis of the material consumption scheduling problem M Bentert, R Bredereck, P Györgyi, A Kaczmarczyk, R Niedermeier Journal of Scheduling, 1-14, 2023 | 2 | 2023 |
| On the number of touching pairs in a set of planar curves P Györgyi, B Hujter, S Kisfaludi-Bak Computational Geometry 67, 29-37, 2018 | 2 | 2018 |
| A P2P based storage system with reputation points and simulation results B Bakondi, P Burcsi, P Györgyi, D Herskovics, P Ligeti, L Mérai, DA Nagy, ... Central European Conference on Cryptology (CECC), 2014 | 2 | 2014 |
| Scheduling with non-renewable resources P Györgyi Eötvös University, 2013 | 2 | 2013 |
| Joint replenishment meets scheduling P Györgyi, T Kis, T Tamási, J Békési Journal of Scheduling 26 (1), 77-94, 2023 | 1 | 2023 |
| Approximation algorithms for coupled task scheduling minimizing the sum of completion times D Fischer, P Györgyi Annals of Operations Research, 1-22, 2023 | | 2023 |
| An online joint replenishment problem combined with single machine scheduling P Györgyi, T Kis, T Tamási arXiv preprint arXiv:2208.02748, 2022 | | 2022 |
| Joint replenishment meets scheduling T Kis, P Györgyi, T Tamási, J Békési | | 2022 |
| Joint replenishment meets scheduling J Békési, P Györgyi, T Kis | | 2020 |
Tamás KisInstitute for Computer Science and ControlVerified email at sztaki.mta.hu
