We consider a class of general Gt/Gt/1 single-server queues, including the Mt/Mt/1 queue, with unlimited waiting space, service in order of arrival, and a time-varying arrival rate, where the service rate at each time is subject to control. We study the rate-matching control, where the service rate is made proportional to the arrival rate. We show that the model with the rate-matching control c...

We consider a class of general Gt/Gt/1 single-server queues, including the Mt/Mt/1 queue, with unlimited waiting space, service in order of arrival and a time-varying arrival rate, where the the service rate at each time is subject to control. We study the rate-matching control, where the the service rate is made proportional to the arrival rate. We show that the model with the rate-matching co...

BACKGROUND Reducing inequalities in access to the National Health Service is a key government priority. This study investigates the extent to which equitable access is achieved in one routinely administered hospital waiting list system. METHODS Using hospital episode statistics for one hospital in the North West of England, a retrospective study of waiting times to surgery was undertaken for ...

The process scheduling, is one of the most important tasks of the operating system. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. In this paper, a nonlinear programming mathematical model...