This paper addresses an important question of how to achieve an appropriate and nearly uniform work-load for an under-utilized staff in a waiting line situation by scheduling an appropriate amount of supplementary work during the idle time. We present an M/G/1 queue with a special server’s vacation policy to model this situation. In this system, after serving all arriving customers, the server...

In monetary models in which agents are subject to trading shocks there is typically an ex-post inefficiency in that some agents are holding idle balances while others are cash constrained. This inefficiency creates a role for financial intermediaries, such as banks, who accept nominal deposits and make nominal loans. We show that in general financial intermediation improves the allocation and t...

Distributed systems frequently have large numbers of idle computers and workstations. If we could make use of these, then considerable computing power could be harnessed at low cost. We analyze such systems using Brownian motion with drift to model the execution of a program distributed over the idle computers in a network of idle and busy processors, determining how the use of these “transient...

No abstract available

We consider the problem of evaluating an appointment schedule for outpatients in a hospital. Given a fixed-length session during which a physician sees K patients, each patient has to be given an appointment time during this session in advance. When a patient arrives on its appointment, the consultations of the previous patients are either already finished or are still going on, which respectiv...

Objectives: Modern data centers serving web and mobile applications employ distributed load balancers. The Join Idle Queue (JIQ) algorithm is ideally suited for balancing in a setup. It attains fast response time by directing service requests to idle servers which can immediately process them. However, JIQ not optimal tracking leaving room improvement.
 Methods: We observed that assigns no...