default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Jacko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Ugur Satic
, Peter Jacko, Christopher Kirkbride:
A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem. Eur. J. Oper. Res. 315(2): 454-469 (2024)- [j23]Yaroslav Pylyavskyy, Peter Jacko, Ahmed Kheiri:
A generic approach to conference scheduling with integer programming. Eur. J. Oper. Res. 317(2): 487-499 (2024) - [c14]Ahmed Kheiri, Yaroslav Pylyavskyy, Peter Jacko:
Efficient Scheduling of GECCO Conferences using Hyper-heuristic Algorithms. GECCO Companion 2024: 1732-1737 - 2023
- [j22]Pavla Krotka, Katharina Hees, Peter Jacko, Dominic Magirr, Martin Posch, Marta Bofill Roig:
NCC: An R-package for analysis and simulation of platform trials with non-concurrent controls. SoftwareX 23: 101437 (2023) - [j21]Elias Laurin Meyer, Tobias Mielke, Tom Parke, Peter Jacko, Franz Koenig:
SIMPLE - A modular tool for simulating complex platform trials. SoftwareX 23: 101515 (2023) - 2022
- [j20]S. Faye Williamson, Peter Jacko, Thomas Jaki:
Generalisations of a Bayesian decision-theoretic randomisation procedure and the impact of delayed responses. Comput. Stat. Data Anal. 174: 107407 (2022) - [j19]Ugur Satic, Peter Jacko, Christopher Kirkbride:
Performance evaluation of scheduling policies for the dynamic and stochastic resource-constrained multi-project scheduling problem. Int. J. Prod. Res. 60(4): 1411-1423 (2022) - [j18]Esa Hyytiä, Peter Jacko, Rhonda Righter:
Routing with too much information? Queueing Syst. Theory Appl. 100(3-4): 441-443 (2022) - 2021
- [c13]Lachlan J. Gibson, Peter Jacko, Yoni Nazarathy:
A Novel Implementation of Q-Learning for the Whittle Index. VALUETOOLS 2021: 154-170 - 2020
- [j17]Stephen Ford, Michael P. Atkinson, Kevin Glazebrook, Peter Jacko:
On the dynamic allocation of assets subject to failure. Eur. J. Oper. Res. 284(1): 227-239 (2020)
2010 – 2019
- 2019
- [c12]Ugur Satic, Peter Jacko, Christopher Kirkbride:
Performance Evaluation of Scheduling Policies for the DRCMPSP. ASMTA 2019: 100-114 - [c11]Francis Garuba, Marc Goerigk, Peter Jacko:
Robust Network Capacity Expansion with Non-Linear Costs. ATMOS 2019: 5:1-5:13 - [i4]Peter Jacko:
The Finite-Horizon Two-Armed Bandit Problem with Binary Responses: A Multidisciplinary Survey of the History, State of the Art, and Myths. CoRR abs/1906.10173 (2019) - 2017
- [j16]S. Faye Williamson, Peter Jacko, Sofia S. Villar, Thomas Jaki:
A Bayesian adaptive design for clinical trials in rare diseases. Comput. Stat. Data Anal. 113: 136-153 (2017) - [j15]Peter Jacko, Evsey Morozov, Lyubov Potakhina, Ina Maria Verloop:
Maximal flow-level stability of best-rate schedulers in heterogeneous wireless systems. Trans. Emerg. Telecommun. Technol. 28(1) (2017) - [j14]Urtzi Ayesta, Peter Jacko, Vladimír Novák:
Scheduling of multi-class multi-server queueing systems with abandonments. J. Sched. 20(2): 129-145 (2017) - 2016
- [j13]Peter Jacko:
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. Ann. Oper. Res. 241(1-2): 83-107 (2016) - [j12]Urtzi Ayesta, Martin Erausquin, Eva Ferreira, Peter Jacko:
Optimal dynamic resource allocation to prevent defaults. Oper. Res. Lett. 44(4): 451-456 (2016) - [j11]Fabio Cecchi, Peter Jacko:
Nearly-optimal scheduling of users with Markovian time-varying transmission rates. Perform. Evaluation 99-100: 16-36 (2016) - [c10]Vincenzo Mancuso, Arash Asadi, Peter Jacko:
Tie-breaking can maximize fairness without sacrificing throughput in D2D-assisted networks. WoWMoM 2016: 1-9 - 2015
- [c9]Arash Asadi, Vincenzo Mancuso, Peter Jacko:
Floating band D2D: Exploring and exploiting the potentials of adaptive D2D-enabled networks. WOWMOM 2015: 1-9 - 2014
- [j10]Darina Graczová, Peter Jacko:
Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories. Oper. Res. 62(3): 696-711 (2014) - [j9]Ianire Taboada, Fidel Liberal, Peter Jacko:
An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels. Perform. Evaluation 79: 90-103 (2014) - [j8]Arash Asadi, Peter Jacko, Vincenzo Mancuso:
Modeling D2D communications with LTE and WiFi. SIGMETRICS Perform. Evaluation Rev. 42(2): 55-57 (2014) - [c8]Ianire Taboada, Peter Jacko, U. Ayestaa, Fidel Liberal:
Opportunistic scheduling of flows with general size distribution in wireless time-varying channels. ITC 2014: 1-9 - [i3]Arash Asadi, Peter Jacko, Vincenzo Mancuso:
Modeling Multi-mode D2D Communications in LTE. CoRR abs/1405.6689 (2014) - 2013
- [j7]Konstantin Avrachenkov, Urtzi Ayesta, Josu Doncel, Peter Jacko:
Congestion control of TCP flows in Internet routers by means of index policy. Comput. Networks 57(17): 3463-3478 (2013) - [c7]Fabio Cecchi, Peter Jacko:
Scheduling of users with markovian time-varying transmission rates. SIGMETRICS 2013: 129-140 - 2012
- [j6]Peter Jacko, Brunilde Sansò:
Optimal anticipative congestion control of flows with time-varying input stream. Perform. Evaluation 69(2): 86-101 (2012) - [j5]Konstantin Avrachenkov, Urtzi Ayesta, Josu Doncel, Peter Jacko:
Optimal congestion control of TCP flows for internet routers. SIGMETRICS Perform. Evaluation Rev. 40(3): 62-64 (2012) - [c6]Konstantin Avrachenkov, Peter Jacko:
CCN interest forwarding strategy as Multi-Armed Bandit model with delays. NetGCooP 2012: 38-43 - [c5]Peter Jacko, Sofia S. Villar:
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback. ITC 2012: 1-8 - [i2]Konstantin Avrachenkov, Peter Jacko:
CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays. CoRR abs/1204.0416 (2012) - [i1]Josu Doncel, Urtzi Ayesta, Konstantin Avrachenkov, Peter Jacko:
Congestion Control of TCP Flows in Internet Routers by Means of Index Policy. CoRR abs/1209.3638 (2012) - 2011
- [j4]Peter Jacko:
Value of information in optimal flow-level scheduling of users with Markovian time-varying channels. Perform. Evaluation 68(11): 1022-1036 (2011) - [c4]Urtzi Ayesta, Martin Erausquin, Peter Jacko:
Resource-sharing in a single server with time-varying capacity. Allerton 2011: 377-383 - [c3]Urtzi Ayesta, Peter Jacko, Vladimír Novák:
A nearly-optimal index rule for scheduling of users with abandonment. INFOCOM 2011: 2849-2857 - [c2]Peter Jacko:
Optimal index rules for single resource allocation to stochastic dynamic competitors. VALUETOOLS 2011: 425-433 - 2010
- [j3]Urtzi Ayesta, Martin Erausquin, Peter Jacko:
A modeling framework for optimizing the flow-level scheduling with time-varying channels. Perform. Evaluation 67(11): 1014-1029 (2010)
2000 – 2009
- 2008
- [c1]Peter Jacko, José Niño-Mora:
Admission control and routing to parallel queues with delayed information via marginal productivity indices. VALUETOOLS 2008: 52 - 2007
- [j2]Peter Jacko, José Niño-Mora:
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract). Electron. Notes Discret. Math. 28: 145-152 (2007) - 2005
- [j1]Peter Jacko, Stanislav Jendrol':
Distance Coloring of the Hexagonal Lattice. Discuss. Math. Graph Theory 25(1-2): 151-166 (2005)
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 2025-01-09 13:00 CET 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:
