We explore customer choice behavior when they face a choice between service providers of unknown service value. Customers arrive according to a Poisson process to the market. Service times are exponentially distributed with the same rate at each service provider. Both the service providers are...

We present a new unifying framework for investigating throughput-WIP (Work-in-Process) optimal control problems in queueing systems, based on reformulating them as linear programming (LP) problems with special structure: We show that if a throughput-WIP performance pair in a stochastic system...

A modified approach to treat traffic flow parameters (flow, density and speed) has been introduced in this paper. A queuing analysis has been conducted on traffic flow data on Interstate 94 in the Minneapolis-St. Paul metro area. A methodology has been developed to calibrate loop detector count...

Many service systems exhibit service slowdowns when the system is congested. Our goal in this paper is to investigate this phenomenon and its e ffect on service performance. We modify the Erlang-A model to account for service slowdowns and perform an asymptotic analysis in the Quality-and-E...

Graphical representations of spreadsheet queueing simulations can be used to teach students about queues and queueing processes. A customer graph shows the experience of every individual customer in a queue, based on arrival time, start of service, end of service, and showing clearly the length...

We compare the performance of seven methods in computing or approximating service levels for nonstationary M(t)/M/s(t) queueing systems: an exact method (a Runge-Kutta ordinary-differential-equation solver), the randomization method, a closure (or surrogate-distribution) approximation, a direct...

This paper aims to analyze the variation in the delivery of diagnostic imaging services in order to suggest possible solutions for the reduction of waiting times, increase the quality of services and reduce financial costs. Design: This study provides a logic model to manage waiting times in a...

We address the problem of scheduling a multiclass "M/M/m" queue with Bernoulli feedback on "m" parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers...

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where requests are attended first by lower level servers, and then some of the served customers are referred to higher level servers. In the first model,...