This paper considers an M/G/c queueing system serving a finite number (J) of distinct customer classes. Performance of the system, as measured by the vector of steady-state expected waiting times of the customer classes (the performance vector), may be controlled by adopting an appropriate priority discipline.
We provide a deterministic example in which parties sign a contract which they anticipate will be subsequently renegotiated. The renegotiation is socially desirable. In the example, the cost of writing and enforcing contracts increases their complexity.
A great deal of research on the empirical behavior of inventories examines some variant of the production smoothing model of finished goods inventories. The overall assessment of this model that exists in the literature is quite negative: there is little evidence that manufacturers hold inventories of finished goods in order to smooth production patterns. This paper examines whether this negative assessment of the model is due to one or both of two features: costs shocks and seasonal fluctuations.
This paper develops and implements a technique for estimating a model of the bid/ask spread. The spread is decomposed into two components, one due to asymmetric information and one due to inventory costs, specialist monopoly power, and clearing costs. The model is estimated using NYSE common stock transaction prices in the period 1981-1983. Cross-sectional regression analysis is then used to relate time-series estimated spread components to other stock characteristics.
We consider single-server loss systems with exponential service times and non-stationary Poisson input. We prove that if the arrival rate is given by a periodic function, the proportion of lost customers is convex increasing in the amplitude.
This paper considers general (single facility) queueing systems with exponential service times, dealing with a finite number J of distinct customer classes. Performance of the system, as measured by the vector of steady state expected sojourn times of the customer classes (the performance vector) may be controlled by adopting an appropriate preemptive priority discipline.
We present an exact solution method for a single-server queueing system which alternates between periods in which service can be provided (on-periods) and periods in which the server is out of operation (off-periods). The arrival process is Poisson, on-periods are assumed to have a phase-type distribution, and service times and off-periods are assumed to be arbitrary.
We consider the polymatroidal flow network model which incorporates two important extensions of the standard maximal flow problem: general concave objective functions of the vector of supplies to a collection of sinks, as well as polymatroidal capacity restrictions on sets of arcs emanating from or pointing to a common node. A number of important applications are reviewed.
We consider general queueing models dealing with multiple classes of customers and address the question under what conditions and in what (stochastic) sense the marginal increase in various performance measures, resulting from the addition of a new class of customers to an existing system, is larger than if the same class were added to a system dealing with only a subset of its current customer base.