Péter Györgyi

According to our database, Péter Györgyi authored at least 17 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Approximation algorithms for coupled task scheduling minimizing the sum of completion times.

David Fischer, Péter Györgyi

Ann. Oper. Res., September, 2023

A multivariate complexity analysis of the material consumption scheduling problem.

Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier

J. Sched., August, 2023

An online joint replenishment problem combined with single machine scheduling.

Péter Györgyi, Tamás Kis, Tímea Tamási

J. Comb. Optim., July, 2023

Joint replenishment meets scheduling.

Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési

J. Sched., February, 2023

2022

New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints.

Péter Györgyi, Tamás Kis

Discret. Appl. Math., 2022

2021

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests.

Márton Drótos, Péter Györgyi, Markó Horváth, Tamás Kis

Comput. Ind. Eng., 2021

2020

A common approximation framework for early work, late work, and resource leveling problems.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2020

2019

Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.

Péter Györgyi, Tamás Kis

J. Sched., 2019

A probabilistic approach to pickup and delivery problems with time window uncertainty.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2019

A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.

Péter Györgyi, Tamás Kis

CoRR, 2019

2018

On the number of touching pairs in a set of planar curves.

Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak

Comput. Geom., 2018

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.

Péter Györgyi, Tamás Kis

Comput. Ind. Eng., 2018

2017

A PTAS for a resource scheduling problem with arbitrary number of parallel machines.

Péter Györgyi

Oper. Res. Lett., 2017

Approximation schemes for parallel machine scheduling with non-renewable resources.

Péter Györgyi, Tamás Kis

Eur. J. Oper. Res., 2017

2015

Reductions between scheduling problems with non-renewable resources and knapsack problems.

Péter Györgyi, Tamás Kis

Theor. Comput. Sci., 2015

Approximability of scheduling problems with resource consuming jobs.

Péter Györgyi, Tamás Kis

Ann. Oper. Res., 2015

2014

Approximation schemes for single machine scheduling with non-renewable resource constraints.

Péter Györgyi, Tamás Kis

J. Sched., 2014