Queues with Advance Reservations
by Professor Peter Taylor
Abstract: Queues where on "arrival" customers make a reservation for service at some time in the future are endemic in
practice and relatively under-analysed in theory.
Simulations illustrate some interesting implications of the facility to make such reservations. For example introducing independent and identically distributed reservation periods into an Erlang loss system changes the blocking probability from that given by the Erlang B formula, despite the fact that the process of 'reserved arrivals' is still Poisson.
In this talk we shall discuss some preliminary analyses of such queues. In particular, we shall obtain various transient and stationary distributions associated with the "bookings diary" for the infinite server system, and discuss attempts to extend the analysis to blocking probability calculations.
(Joint work with R.J. Maillardet)
For More Information: Emma Lockwood firstname.lastname@example.org Tel: +61 3 8344 1617