Perceptions of Waiting Time in Different Service Queues (unpublished, 2005)
نویسنده
چکیده
This article investigates the extent to which there is a gap between customers' perception of waiting time compared with actual waiting times; and whether this gap varies according to service context. It also investigates a new proposition that customers’ perception of time available for the service influences their perception of wait time. A field study collected 455 actual and perceived customer waiting times in a single queue single server system from a retail grocery store, cafeteria, post office, bus stop and vegetable market. Results showed that perceptions can be significantly greater than actual waiting time across the study; there was no correlation to the service context; and perception varied inversely to the time available.
منابع مشابه
A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
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...
متن کاملBernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters
In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...
متن کاملProcessor-sharing and Random-service Queues with Semi-markovian Arrivals
We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...
متن کاملAsymptotics of Closed Fork and Join Queues with Subexponential Service Times
We consider a closed fork and join queueing network where several lines feed a single assembly station. Under the assumption that at least one service time distribution is subexponential, we obtain the tail asymptotics of transient cycle times and waiting times. We also discuss under which conditions these results can be generalized to the tail asymptotics of stationary cycle times and waiting ...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010