Peter Jacko

Peter Jacko

Auto-generated profile, based on publicly available information

Peter Jacko

Department of Management Science, Lancaster University, UK

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2010 in Performance Evaluation
Verified
Journal Article
Closed access
UAUrtzi Ayesta
Urtzi Ayesta
MEMartin Erausquin
Martin Erausquin
PJPeter Jacko
Peter Jacko

1 September 2017 in Computational Statistics & Data Analysis
Verified
Journal Article
Open access
SWS. Faye Williamson
S. Faye Williamson
PJPeter Jacko
Peter Jacko
SVSofía S. Villar
Sofía S. Villar
TJThomas Jaki
Thomas Jaki
Development of treatments for rare diseases is challenging due to the limited number of patients available for participation. Learning about treatment effectiveness with a view to treat patients in the larger outside population, as in the traditional fixed randomised design, may not be a plausible goal. An alternative goal is to treat the patients within the trial as effectively as possible. Using the framework of finite-horizon Markov decision processes and dynamic programming (DP), a novel randomised response-adaptive design is proposed which maximises the total number of patient successes in the trial and penalises if a minimum number of patients are not recruited to each treatment arm. Several performance measures of the proposed design are evaluated and compared to alternative designs through extensive simulation studies using a recently published trial as motivation. For simplicity, a two-armed trial with binary endpoints and immediate responses is considered. Simulation results for the proposed design show that: (i) the percentage of patients allocated to the superior arm is much higher than in the traditional fixed randomised design; (ii) relative to the optimal DP design, the power is largely improved upon and (iii) it exhibits only a very small bias and mean squared error of the treatment effect estimator. Furthermore, this design is fully randomised which is an advantage from a practical point of view because it protects the trial against various sources of bias. As such, the proposed design addresses some of the key issues that have been suggested as preventing so-called bandit models from being implemented in clinical practice.

1 December 2013 in Computer Networks
Verified
Journal Article
Closed access
KAKonstantin Avrachenkov
Konstantin Avrachenkov
UAU. Ayesta
U. Ayesta
JDJosu Doncel
Josu Doncel
PJP. Jacko
P. Jacko

26 December 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
USUgur Satic
Ugur Satic
PJPeter Jacko
Peter Jacko
CKChristopher Kirkbride
Christopher Kirkbride
In this study, we consider the dynamic and stochastic resource-constrained multi-project scheduling problem where projects generate rewards at their completion, completions later than a due date cause tardiness costs, task duration is uncertain, and new projects arrive randomly during the ongoing project execution both of which disturb the existing project scheduling plan. We model this problem as a discrete-time Markov decision process and explore the performance and computational limitations of solving the problem by dynamic programming. We run and compare five different solution approaches, which are: a dynamic programming algorithm to determine a policy that maximises the time-average profit, a genetic algorithm and an optimal reactive baseline algorithm, both generate a schedule to maximise the total profit of ongoing projects, a rule-based algorithm which prioritises processing of tasks with the highest processing durations, and a worst decision algorithm to seek a non-idling policy that minimises the time-average profit. The performance of the optimal reactive baseline algorithm is the closest to the optimal policies of the dynamic programming algorithm, but its results are suboptimal, up to 37.6%. Alternative scheduling algorithms are close to optimal with low project arrival probability but quickly deteriorate their performance as the probability increases.