• 제목/요약/키워드: service waiting

검색결과 452건 처리시간 0.027초

The Estimation of Patient's Waiting-Time Using Parking Time (주차시간을 이용한 외래환자 대기시간 추정)

  • Song, Jung-Hup
    • Quality Improvement in Health Care
    • /
    • 제2권2호
    • /
    • pp.20-30
    • /
    • 1996
  • Background : Theoretically as the waiting-time of patient is estimated in queueing, many men and much money are needed. But being the estimation of patient s waiting-time very important in hospital service, so the continuous monitoring of waiting-time is inevitable. To verify that the estimation of waiting-time using parking time is economical, effective and continuous monitoring method and to develop utilizing the method, this study was done. Method : In parking confirmation office, the personnel of parking office wrote parking confirm time, chart number and whether medical examination and treatment finish or not in parking ticket. The next day the parking tickets were gathered and the above data were input. The input parking data were connected with the hospital outpatient file indexing chart number. Then the patient' s data for department, new patient or not, reservation or not, receipt time and payment time were retrieved. The group for finishing medical treatment were compared with that for not finishing in average time lag between confirmation and out-time for hospital. And In-time for hospital, receipt time, payment and out-time for hospital were also analyzed. Result : Confirming parking ticket, the group for finished medical treatment left hospital after 7 minutes. This result showed that the patient for finished medical treatment left hospital immediately. So parking time was reasonable to estimation of hospital-time was concluded. The time for medical treatment, diagnosis and test was constant for all patients and short for waiting time, Then I concluded that the parking time was reasonable for estimation patient's waiting time. Overall patient's waiting time was 113 minutes and new patient's time was 149 minutes, old patient's times was 109 minutes. Waiting time for reservation patient was 98 minutes and for non reservation patient was 122 minutes. The time from hospital arrival to payment was 50 minutes for the group of reservation patient and 69 minutes for non-reservation group. The time from payment to hospital leaving was 51 minutes and 56 minutes for non reservation group. The short time difference between reserved group and not reserved group from payment to hospital leaving time was due to bottle neck effect. Conclusion : The estimation of patient's waiting time using parking time was reasonable because the possession of car was common and the time for medical treatment was equal and the patient after treatment left hospital immediately. Using this method, timely, fast evaluation and continuous monitoring of the intervention effect were possible.

  • PDF

A RECENT PROGRESS IN ALGORITHMIC ANALYSIS OF FIFO QUEUES WITH MARKOVIAN ARRIVAL STEAMS

  • Takine, Tetsuya
    • Journal of the Korean Mathematical Society
    • /
    • 제38권4호
    • /
    • pp.807-842
    • /
    • 2001
  • This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

  • PDF

Vehicle Waiting Time Information Service using Vehicle Object Detection at Fuel Charging Station

  • Rijayanti, Rita;Muhammad, Rifqi Fikri;Hwang, Mintae
    • Journal of information and communication convergence engineering
    • /
    • 제18권3호
    • /
    • pp.147-154
    • /
    • 2020
  • In this study, we created a system that can determine the number of vehicles entering and departing a charging station in real time for solving waiting time problems during refueling. Accordingly, we use the You Only Look Once object detection algorithm to detect and count the number of vehicles in the charging station and send the data to the Firebase Realtime Database. The result is shown using an Android application that provides a map function with the Kakao Maps API at the user interface side. Our system has an accuracy of 91% and an average response time of 3.1 s. Therefore, this system can be used by drivers to determine the availability of a charging station and to identify the charging station with the least waiting time for charging their vehicle.

Optimal Buffer Allocation in Tandem Queues with Communication Blocking

  • Seo, Dong-Won;Ko, Sung-Seok;Jung, Uk
    • ETRI Journal
    • /
    • 제31권1호
    • /
    • pp.86-88
    • /
    • 2009
  • In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

  • PDF

TWO-CLASS M/PH,G/1 QUEUE WITH IMPATIENCE OF HIGH-PRIORITY CUSTOMERS

  • Kim, Jeongsim
    • Journal of applied mathematics & informatics
    • /
    • 제30권5_6호
    • /
    • pp.749-757
    • /
    • 2012
  • We consider the M/PH,G/1 queue with two classes of customers in which class-1 customers have deterministic impatience time and have preemptive priority over class-2 customers who are assumed to be infinitely patient. The service times of class-1 and class-2 customers have a phase-type distribution and a general distribution, respectively. We obtain performance measures of class-2 customers such as the queue length distribution, the waiting time distribution and the sojourn time distribution, by analyzing the busy period of class-1 customers. We also compute the moments of the queue length and the waiting and sojourn times.

Design of the Waiting List based O2O Service Platform for the Share House (쉐어하우스를 위한 웨이팅 리스트 기반의 O2O 서비스 플랫폼 구현)

  • Phyo, Gyung-soo;Park, Jin-tae;Kim, Hyun-gook;Moon, Il-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국정보통신학회 2016년도 추계학술대회
    • /
    • pp.681-683
    • /
    • 2016
  • Recently, sharing economy is getting the attention of the public. So this phenomenon to share their goods, home, gifts, etc. in various fields has been increased. Typically when traveling away from home to host as "Airbnb", the share house to share their homes are traded most actively. Through a share house host can make money using house empty, customers can take advantage of the hostel while traveling at low prices. The existing share house system must ensure that every time they empty the house Customers, host had the inconvenience of having to wait for the application of the tenant customers. To solve this problem and to implement a service platform based on the waiting list. Through this platform, customers will be able to eliminate the inconvenience of having to find the house every time you want to apply for a tenant waiting to get home, give the order to wait.

  • PDF

A Study on Restaurant Envirionment and Crowding in Foodservice Company (외식기업의 레스토랑 환경과 혼잡지각에 관한 연구)

  • Yang, Tai-Seok
    • Proceedings of the Culinary Society of Korean Academy Conference
    • /
    • 한국조리학회 2006년도 제41차 정기하계학술세미나
    • /
    • pp.115-134
    • /
    • 2006
  • This study was conducted during a period from July 4 to 30 to investigate the effect of restaurant environment upon customer's satisfaction and crowdedness awareness. Total 800sets of questionnaire were distributed among major food service corporations. They were 16 restaurants from McDonald, Burger King, Popeyes, KFC, Rits Carlton, Intercontinental, The Westin Chosun, Hilton, Merriot, Outback Steak House, Bennigans, VIPS, Pizza Hut Pul-hyanggi(Scent of grass), Nolboo Co.,, and Our Story, and received 50 see each to hand out to their customers. Out of total 800 sets of questionnaires, 592 sets (74.25% were retrieved and underwent a Multiple Regression Analysis. We found the following results from the study. First among each variable of restaurant environment that had a significant effect on the crowding, 'pTast service' and 'responsiveness to customer complaints' sooted a regression coefficient value 0.381 and 0.325 respectively. Second, among each restaurant environment factor that had a significant effect on crowding, 'quality of facility' sooted the highest regression coefficient value 0.423 with a standard error score 0.1074, fellowed by 'status of waiting', 'overall ambience' and 'service quality' in ascending order. Third, in the analysis of the effect of each environmental factor upon the satisfaction rate, 'status of waiting' showed the highest regression coefficient value 0.3821 with a standard error score 0.4565, followed by 'cleanliness', 'service quality' and 'conveniency', in ascending order.

  • PDF

Comparison of Customer Satisfaction Before and After One-stop Service (당일 검사에 대한 원스톱 서비스 전과 후의 고객만족도 비교)

  • Kang, Kun-Woo;Lee, Eui-Jeong;Lee, Hyun-Kyung;Lee, Eun-Son;Lim, Yang-Hee;Han, Hyung-Tae
    • Quality Improvement in Health Care
    • /
    • 제26권2호
    • /
    • pp.66-76
    • /
    • 2020
  • Purpose:Hospitals provide top medical service using exceptional manpower, medical technology, and state-of-the-art equipment, thus raising the standard of customer satisfaction. In addition, their medical service is becoming higher than before. One-stop service is a good way to improve the quality of customer-centered service as a qualitative marketing strategy. This study thus aims to facilitate subsequent research and compare customer satisfaction before and after one-stop service. Methods: The study included 72 patients who received the reserved examination and one-stop service for 20 days from April 23 to May 12, 2014. The surveyed questionnaire data were analyzed using SPSS 18.00. Results: The comparison results of customer satisfaction showed that the satisfaction score was generally high in the areas of kindness of examination staff, the speedy/accuracy of work processing of examination staff, and the kindness of reservation staff. The group before one-stop service showed their dissatisfaction with repeated visits and difficulty of booking a desired day. The group after one-stop service showed dissatisfaction with the long waiting time for examination or same-day treatment. Conclusion: The one-stop service showed good results, but new uncomfortable issues for the customer were revealed as well, which may result in more work of employees. Considering the characteristics of various clinical departments, the author hopes to find an efficient operation plan through the development and improvement of an appropriate one-stop service method.

AN M/G/1 QUEUE WITH GENERALIZED VACATIONS AND EXHAUSTIVE SERVICE

  • Lim, Jong-Seul;Lee, Sang-Heon
    • Journal of applied mathematics & informatics
    • /
    • 제6권1호
    • /
    • pp.309-320
    • /
    • 1999
  • Models of single-server queues with vacations have been widely used to study the performance of many computer communi-cation and production systems. In this paper we analyze an M/G/1 queue with generalized vacations and exhaustive service. This sys-tem has been shown to possess a stochastic decomposition property. That is the customer waiting time in this system is distributed as the sum of the waiting time in a regular M/G/1 queue with no va-cations and the additional delay due to vacations. Herein a general formula for the additional delay is derived for a wide class of vacation policies. The formula is also extended to cases with multiple types of vacations. Using these new formulas existing results for certain vacation models are easily re-derived and unified.

An analysis of the $M^{X}/G/1$ system with various vacations and set-up time (준비기간을 포함한 다양한 휴가형태에서의 $M^{X}/G/1$ 시스템 분석)

  • Hur, Sun;Yoon, Young-Ho;Ahn, Sun-Eung
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • 제27권2호
    • /
    • pp.111-121
    • /
    • 2002
  • In this paper, we analyze an M$^{x}$ /G/1 with three types of vacation periods including setup time. Three types of vacations are : N-policy, single vacation, and multiple vacation. We consider compound poisson arrival process and general service time, where the server starts his service when a setup is completed. We find the PGF of the number of customers in system and LST of waiting time, with welch we obtain their means. A decomposition property for the system sloe and waiting time is described also.