Currently, the median waiting time for total hip and knee replacement in Ontario is greater than 6 months. Waiting longer than 6 months is not recommended and may result in lower post-operative benefits. We developed a simulation model to estimate the proportion of patients who would receive surgery within the recommended waiting time for surgery over a 10-year period considering a wide range o...

This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time before possible entry into service exceeds the patience time. The dynamics of the system is represented in terms of a pair of measure-valued process...

Using constructive, sample-path arguments, we derive a variety of transform-free results about queue lengths and waiting times for the M/G/1/K queue. In classical analyses of M/G/1/K, it is typical to work with Markov processes obtained by defining the “state” of the system at a time epoch to be the number of customers present and, as supplementary information, the remaining service time of the...

The universal typical-signal estimators of entropy and cross-entropy based on the asymptotics recurrence waiting times play an important role in information theory. Building their construction, we introduce study production context nonequilibrium statistical mechanics one-sided shifts over finite alphabets.

This paper deals with the optimal operation of a single removable and unreliable server in an Npolicy two-phase M/M/1 queueing system with gating, server startups and unpredictable breakdowns. Arrivals occur in batches according to a compound Poisson process and waiting customers receive batch service all at a time in the first phase and proceed to the second phase to receive individual service...

In this paper we study situations in which two firms offer identical service for possibly different prices and response times. Customers’ choice between firms is based on their full price, which includes the service fee plus (expected) waiting costs. We consider a two level game. The first game is a non-cooperative game among customers who observe the prices (but not the queue sizes) and then d...

Feedback loops are known as a versatile tool for controlling transport in small systems, which usually have large intrinsic fluctuations. Here we investigate the control of a temporal correlation function, the waiting-time distribution, under active and passive feedback conditions. We develop a general formalism and then specify to the simple unidirectional transport model, where we compare cos...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

This paper studies a multiclass queueing system with endogenous abandonments where congestion a↵ects customers’ abandonment behavior and vice versa. Our model captures this interaction by developing two closely related models: an abandonment model and a queueing model. In the abandonment model, customers take the virtual waiting time distribution as given. Class k customers receive a reward rk ...