• Title/Summary/Keyword: mean waiting time

Search Result 128, Processing Time 0.026 seconds

Heuristic Interpretation of the Mean Waiting Time of $Geo^X/G/1$ Vacation Queues with Set-up Time (휴리스틱 방법을 이용한 준비기간을 갖는 휴가형 $Geo^X/G/1$ 모형의 평균대기시간 분석)

  • Lee Sung-H.;Kim Sung-J.;Chae Kyung-C.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1111-1115
    • /
    • 2006
  • We present heuristic interpretations of the mean waiting time of $Geo^X/G/1$ vacation queues with set-up time. The heuristic interpretation of the mean waiting time is originally proposed for the continuous-time queues. We demonstrate that the heuristic approach is useful for the discrete-time queues as well.

  • PDF

Heuristic Interpretation of the Mean Waiting Time for $Geo^{X}/G/1$ Queues (휴리스틱 방법에 의한 휴가형 $Geo^{X}/G/1$ 대기행렬의 평균대기시간 분석)

  • Kim, Sung-J.;Chae, Kyung-C.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.1137-1140
    • /
    • 2005
  • We present the discrete-time version of the heuristic interpretation of the mean waiting time known well about the continuous-time version. The heuristic approach is mainly based on an arriving customer's viewpoint. We obtain the mean waiting time of $Geo^X/G/1$ queueing systems, including vacation queues.

  • PDF

The Relationships among Waiting Time, Patient's Satisfaction, and Revisiting Intention of Outpatients in General Hospital (일 종합병원 외래환자의 진료대기시간 및 환자만족도, 재이용의도와의 관계)

  • Ko, Yu-Kyung
    • Journal of Korean Academy of Nursing Administration
    • /
    • v.16 no.3
    • /
    • pp.219-228
    • /
    • 2010
  • Purpose: The purpose of this study was to explore the degree of delay in waiting time, and the relationships of waiting time, patient satisfaction, and revisiting intention of outpatient in general hospitals. Methods: The data were collected from June 22 to July 4, 2009. A total of 536 outpatients who visited 21 clinics of a general hospital were subjected to evaluate the waiting time. The survey tools used were the Korea Health Industry Development Institutes (2008) tool for patient satisfaction and Reichheld & Sasser (1990) for revisiting intention. The data were analyzed by SAS version 9.1, descriptive statistics, t-test, ANOVA, and Pearson correlation coefficient. Results: The mean patient's waiting time was $28.3{\pm}30.7\;min$, the revealed mean score of patient's satisfaction was 2.92, and the revisiting intention showed was 4.56. The waiting time was negatively correlated with patient's satisfaction (r=-.10, p<.019). Patient's satisfaction was positively correlated with revisiting intention (r=-.51, p<.001). Conclusion: Waiting time management is an important factor of increasing patient's satisfaction and revisiting intention in general hospitals. It is mandatory that reservation management systems take into account the patient's characteristics of visiting outpatient department in order to shorten the real waiting time.

Analysis of mean waiting times for a multiclass cyclic production system (다품목 순환 생산시스템에 대한 평균 대기시간의 분석)

  • Hong, Sung-Jo;Kim, Sang-Jik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.4
    • /
    • pp.639-647
    • /
    • 1998
  • We consider a multiclass production system processed by a single machine with cyclic order. Each part belongs to one of several classes and arrives at each queue in a Poisson process. The processing discipline at each queue is either exhaustive or gated. We introduce a new approach to analysis of mean waiting times for each queue. We formulate mean waiting times as cost functions on state of the system. The mean waiting times are obtained by solving a set of O($J^2$) linear equations, where J is the number of queues in the system. We also obtain the mean number of parts of each queue in the system at an arbitrary time. Based on this result, we plot the numerical values of the mean waiting times for several parameter settings.

  • PDF

Two Queue Single Server Model for the DQDB Man

  • Noh, Seung J.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.2
    • /
    • pp.31-44
    • /
    • 1997
  • This paper presents an approximate analytical model to estimate the mean packet walting times at the stations in the IEEE 802, 6 subnetwork of a metropolitan area network. Each station is modeled as a two queue single server system, which serves data packets and requests from downstream stations according to the DQDB protocol. The model estimates the mean waiting time of the requests and in turn, using the discrete time work conservation law, estimates the mean waiting time for packets. Simulation experiments shows that the model accurately works even under very high traffic loads.

  • PDF

Suggestions on Time-saving Processes of Receiving Medicines at the Outpatient Pharmacy in a University Hospital (일개 대학병원의 투약대기시간 단축방안)

  • Yu, Mi Seon;Park, Hye Soon;Park, Hyoun Jung;Kim, Ji Hwa;Kim, Hee Jeoung;Kim, Sun Young
    • Quality Improvement in Health Care
    • /
    • v.5 no.1
    • /
    • pp.28-40
    • /
    • 1998
  • Background : Many patients have been frequently complaining that they have to spend couples of hours in hospital on visiting outpatient clinic. Among several steps, two major time consuming steps were waiting to see a doctor and/or waiting at pharmacy to get medicine. Therefore not only to provide the proper guidance for medication or counseling on health affairs but also to make waiting time short is very important for the better hospital services. The aim of this study is to validate several time-saving processes to reduce waiting time at outpatient pharmacy and its efficacy. Methods : We surveyed the time interval actually taken to receive medicine after issuing prescription by doctors, and analyzed the data on the bases of relevant or possible causative factors. Then following processes were given to reduce waiting time and resurveyed and compared both data to validate efficacy of those processes : 1. No work-off on Monday and Tuesday 2. Work hour shift to start 30 minutes earlier 3. Changeable work shift between outpatient pharmacy and ward pharmacy according to work load 4. Use of pre-made medicines prescribed more frequently by certain doctors at certain time 5. Cooperation with doctors to use set prescriptions. Results : Before the process, mean waiting time at pharmacy was 29.2 minutes and most time consuming period was from noon to 1 PM, 3 to 4 PM, 1 to 2 PM in order of frequency. Only 37.7 % of patients could get the medicine within 20 minutes. Three times of surveys after process showed mean waiting time at pharmacy were 18.1 minutes, 19.0 minutes, and 17.6 minutes, respectively. And 72.7 %, 81.3%, and 82.2% of patients could get the medicine within 20 minutes. Conclusion : The mean waiting time was markedly reduced with above mentioned processes which applied intradepartmently event hough with little cooperation from other department. Consequently, the complaints of patients were decreased with increasing the satisfaction degree. In conclusion, those suggestions were recommanded to improve the degree of satisfaction of patients.

  • PDF

Heuristic Approach to the Mean Waiting Time of $Geo^x/G/1$ Vacation Queues with N-policy and Setup Time (휴리스틱 방법을 이용한 N정책과 준비기간을 갖는 휴가형 $Geo^x/G/1$ 모형의 평균대기시간 분석)

  • Lee, Sung-Hee;Kim, Sung-Jin;Chae, Kyung-Chul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.1
    • /
    • pp.53-60
    • /
    • 2007
  • We consider the discrete-time $Geo^x/G/1$ queues under N-policy with multiple vacations (a single vacation) and setup time. In this queueing system, the server takes multiple vacations (a single vacation) whenever the system becomes empty, and he begins to serve the customers after setup time only if the queue length is at least a predetermined threshold value N. Using the heuristic approach, we derive the mean waiting time for both vacation models. We demonstrate that the heuristic approach is also useful for the discrete-time queues.

Analysis of Factors Delaying on Waiting Time for Medical Examination of Outpatient on a Hospital (일 병원의 외래진료대기시간 지연요인 분석)

  • Park, Seong-Hi
    • Quality Improvement in Health Care
    • /
    • v.8 no.1
    • /
    • pp.56-72
    • /
    • 2001
  • Background : To shorten processing time for variety of medical affairs of the patient at the outpatient clinic of a big hospital is very important to qualify medical care of the patient. Therefore, patient's waiting time for medical examination is often utilized as a strong tool to evaluate patient satisfaction with a medical care provided. We performed this study to investigate factors delaying related with waiting time for medical examination. Methods : The data were collected from June 26 to July 30, 1999. A total 275 case of medical treatment and 5,634 patients who visited outpatient clinics of a tertiary hospital were subjected to evaluate the waiting time. The data were analyzed using frequency, t-test, ANOVA, $X^2$-test by SPSS Windows 7.5 program. Results : The mean patient's waiting time objectively evaluated ($30.9{\pm}33.9$ min) was longer than that subjectively by patient evaluated ($25.1{\pm}26.2$ min). Patient waiting time objectively evaluated was influenced by the starting time of medical examination, consultation hours, patients arriving time etc, as expected. The time discrepancy between two evaluations was influenced by several causative factors. Regarding the degree of patients accepted waiting time with the medical examination is 20 min. Conclusion : The results show that, besides the starting time of medical examination, consultation hours and patients arriving time, influence the patient's subjective evaluation of waiting time for medical examination and his satisfaction related with the service in the big hospital. In order to improve patient satisfaction related with waiting time for medical examination, it will be effective examination rather than to shorten the real processing time within the consultation room.

  • PDF

Waiting Time Analysis of Discrete-Time BMAP/G/1 Queue Under D-policy (D-정책을 갖는 이산시간 BMAP/G/1 대기행렬의 대기시간 분석)

  • Lee, Se Won
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.1
    • /
    • pp.53-63
    • /
    • 2018
  • In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

An Analysis of M/G/1 Vacation Systems with Restriction to the Waiting Time of the First Customer (첫 고객의 대기시간에 제약이 있는 M/G/1 휴가모형의 분석)

  • Hur, Sun;Lee, Jeong Kyoo;Ahn, Suneung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.2
    • /
    • pp.187-192
    • /
    • 2002
  • In this paper we consider an M/G/1 queueing system with vacation. The length of vacation period may be controlled by the waiting time of the first customer. The server goes on vacation as soon as the system is empty, and resumes service either when the waiting time of the leading customer reaches a predetermined value, or when the vacation period is expired, whichever comes first. We consider two types of vacation, say, multiple vacation type and N-policy type. We derive the steady-state distributions of the number of customers at arbitrary time and arbitrary customer's waiting time by means of decomposition property. Also, the mean lengths of busy period, idle period and a cycle time are given.