Péter Györgyi
Orcid: 0000-0002-2380-5528
According to our database1,
Péter Györgyi
authored at least 17 papers
between 2014 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
0
1
2
3
4
5
4
1
1
1
3
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Approximation algorithms for coupled task scheduling minimizing the sum of completion times.
Ann. Oper. Res., September, 2023
J. Sched., August, 2023
J. Comb. Optim., July, 2023
2022
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., 2022
2021
Comput. Ind. Eng., 2021
2020
A common approximation framework for early work, late work, and resource leveling problems.
Eur. J. Oper. Res., 2020
2019
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.
J. Sched., 2019
A probabilistic approach to pickup and delivery problems with time window uncertainty.
Eur. J. Oper. Res., 2019
A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs.
CoRR, 2019
2018
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Comput. Ind. Eng., 2018
2017
Oper. Res. Lett., 2017
Eur. J. Oper. Res., 2017
2015
Reductions between scheduling problems with non-renewable resources and knapsack problems.
Theor. Comput. Sci., 2015
Ann. Oper. Res., 2015
2014
Approximation schemes for single machine scheduling with non-renewable resource constraints.
J. Sched., 2014