Tim Curtois

Tim Curtois

Auto-generated profile, based on publicly available information

Tim Curtois

University of Nottingham

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 July 2008 in European Journal of Operational Research
Verified
Journal Article
Closed access
EBEdmund K. Burke
Edmund K. Burke
TCTimothy Curtois
Timothy Curtois
GPGerhard Post
Gerhard Post
Rong QuRong Qu
Rong Qu
BVBart Veltman
Bart Veltman

1 January 2012
Verified
Book Chapter
Closed access
PDF file
GOGabriela Ochoa
Gabriela Ochoa
MHMatthew Hyde
Matthew Hyde
TCTim Curtois
Tim Curtois
JVJose A. Vazquez-Rodriguez
Jose A. Vazquez-Rodriguez
JWJames Walker
James Walker
EBEdmund K. Burke
Edmund K. Burke

1 August 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
EBEdmund K. Burke
Edmund K. Burke
TCTim Curtois
Tim Curtois

1 November 2010 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
PDF file
EBE K Burke
E K Burke
TCT Curtois
T Curtois
RQR Qu
R Qu
GBG Vanden Berghe
G Vanden Berghe
The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances.

15 November 2008 in Journal of Heuristics
Verified
Journal Article
Closed access
PDF file
PBPeter Brucker
Peter Brucker
EBEdmund K. Burke
Edmund K. Burke
TCTim Curtois
Tim Curtois
Rong QuRong Qu
Rong Qu
GBGreet Vanden Berghe
Greet Vanden Berghe

1 June 2012 in Omega
Verified
Journal Article
Open access
JLJingpeng Li
Jingpeng Li
EBEdmund K. Burke
Edmund K. Burke
TCTim Curtois
Tim Curtois
SPSanja Petrovic
Sanja Petrovic
Rong QuRong Qu
Rong Qu
We present a hybrid approach of goal programming and meta-heuristic search to find compromise solutions for a difficult employee scheduling problem, i.e. nurse rostering with many hard and soft constraints. By employing a goal programming model with different parameter settings in its objective function, we can easily obtain a coarse solution where only the system constraints (i.e. hard constraints) are satisfied and an ideal objective-value vector where each single goal (i.e. each soft constraint) reaches its optimal value. The coarse solution is generally unusable in practise, but it can act as an initial point for the subsequent meta-heuristic search to speed up the convergence. Also, the ideal objective-value vector is, of course, usually unachievable, but it can help a multi-criteria search method (i.e. compromise programming) to evaluate the fitness of obtained solutions more efficiently. By incorporating three distance metrics with changing weight vectors, we propose a new time-predefined meta-heuristic approach, which we call the falling tide algorithm, and apply it under a multi-objective framework to find various compromise solutions. By this approach, not only can we achieve a trade off between the computational time and the solution quality, but also we can achieve a trade off between the conflicting objectives to enable better decision-making