Simulation Analysis for Multiple-Server Queueing Model with Advertising and Balking

선전과 이탈이 있는 복수 서비스 대기행렬모형에 대한 시뮬레이션 분석

  • Published : 2004.03.01

Abstract

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

Keywords

References

  1. Journal of the Operational Research Society v.47 A Note on a Queueing Optimization Problem Atkinson,J.B.
  2. Management Science v.16 User Delay Costs and Internal Pricing for a Service Facility Dewan,S.;Mendelson,H.
  3. Queueing System Vol Ⅰ: Theory Kleinrock,L.
  4. Econometrica v.37 On Deregulation of Queueing Size by Levying Tolls Naor,P.
  5. Simulation with Visual SLAM and AweSim Pritsker,A.A.B.;O'Reilly,J.
  6. IEEE Transaction on Automatic Control v.AC-30 Optimal Control of Admission to a Queueing System Stidam,S.
  7. Journal of the Operational Research Society v.44 Simulation and Queueing Theory Applied to a Single-server Queue with Advertising and Balking Van Ackere, A.;Nininos,P.