Optimal strategies for rostering servers

Research output: Contribution to journalArticlepeer-review


One of the most vexing problems facing the service industry is the optimal scheduling of servers to both satisfy customer demand and to minimise the cost of doing so. There is a fine line in maintaining this balance and the long queues often seen in practice testify that scientific method has not been utilised effectively, if at all. This study examines some of those models that will benefit scenarios in which servers must be rostered according to specific requirement levels at either at minimum cost or using a minimum number of servers. Several types of integer programming models are considered, including those necessitating 24-hour scheduling and those where the establishment is opened for fewer hours. A numerical example is provided to illustrate how these models can be easily used in practice.
Original languageEnglish
Pages (from-to)163-168
Number of pages6
JournalReview of business research
Issue number1
Publication statusPublished - 2007


  • scheduling
  • integer programming
  • modelling
  • server allocation


Dive into the research topics of 'Optimal strategies for rostering servers'. Together they form a unique fingerprint.

Cite this