default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Györgyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]David Fischer, Péter Györgyi
:
Approximation algorithms for coupled task scheduling minimizing the sum of completion times. Ann. Oper. Res. 328(2): 1387-1408 (2023)- [j15]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): 134 (2023) - [j14]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. J. Sched. 26(1): 77-94 (2023) - [j13]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): 369-382 (2023) - 2022
- [j12]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: 97-109 (2022) - [i4]Péter Györgyi, Tamás Kis, Tímea Tamási:
An online joint replenishment problem combined with single machine scheduling. CoRR abs/2208.02748 (2022) - 2021
- [j11]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: 106999 (2021) - [c1]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021: 11755-11763 - [i3]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR abs/2102.13642 (2021) - [i2]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. CoRR abs/2104.09178 (2021) - 2020
- [j10]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): 129-137 (2020)
2010 – 2019
- 2019
- [j9]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): 909-923 (2019) - [j8]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): 623-634 (2019) - [i1]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 abs/1909.11086 (2019) - 2018
- [j7]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: 220-225 (2018) - [j6]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: 29-37 (2018) - 2017
- [j5]Péter Györgyi, Tamás Kis:
Approximation schemes for parallel machine scheduling with non-renewable resources. Eur. J. Oper. Res. 258(1): 113-123 (2017) - [j4]Péter Györgyi:
A PTAS for a resource scheduling problem with arbitrary number of parallel machines. Oper. Res. Lett. 45(6): 604-609 (2017) - 2015
- [j3]Péter Györgyi, Tamás Kis:
Approximability of scheduling problems with resource consuming jobs. Ann. Oper. Res. 235(1): 319-336 (2015) - [j2]Péter Györgyi, Tamás Kis:
Reductions between scheduling problems with non-renewable resources and knapsack problems. Theor. Comput. Sci. 565: 63-76 (2015) - 2014
- [j1]Péter Györgyi, Tamás Kis:
Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17(2): 135-144 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
