• Title/Summary/Keyword: Waiting Time

Search Result 1,083, Processing Time 0.025 seconds

Effects of Service-environment and Waiting Time on Customers' Quality Perception in Fast-food Type Restaurants (패스트푸드 레스토랑의 서비스 환경과 대기시간이 고객의 품질인지에 미치는 영향)

  • Chung, Hyun-Young
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.11
    • /
    • pp.413-423
    • /
    • 2011
  • Service environments are known to have effects on quality recognition in fine-dining and family type restaurants. The current study explores that the effects are also likely in the fast-food type ones. To verify the research method factor and reliability analysis of SPSS version 18.0 are applied. The program is also used to test the influences among variables. With multiple regression analysis the study finds that there is a significant effect of service environment on quality recognition in fast-food type restaurants. The study also finds that employees' uniform and cleanliness are more influential than waiting time which is generally known as a key factor in fast food service restaurants.

The Effect of Sample Handling on the Rheological Measurement of Regenerated Silk Fibroin Formic Acid Solution using Parallel Plate Geometry

  • Cho, Hee-Jung;Um, In-Chul
    • International Journal of Industrial Entomology and Biomaterials
    • /
    • v.22 no.1
    • /
    • pp.5-10
    • /
    • 2011
  • The effect of sample handling condition on the rheological measurement of regenerated silk fibroin formic acid solution using parallel plate geometry was investigated. In case of loading method, the loading by pouring sample solution resulted in the best reproducibility of rheological measurement. Loading with spoon showed a high variance of viscosity value at low shear rate region ($0.01{\sim}1sec^{-1}$) while loading with syringe exhibited a low reproducibility of viscosity at high shear region ($1{\sim}100sec^{-1}$) with a disappearance of shear thinning phenomenon. It was revealed that the sample loading with small extra amount lead to the most reproducible result. The sample loading with the exact amount for the measuring plate resulted in a lack of reproducibility of high shear viscosity, while the loading with large extra volume produced a limited consistency of low shear viscosity. It was turned out that 3 min. of waiting time before measurement was the optimum condition for reliable result. When the waiting time was less than 1 min., the low shear viscosity was obtained with a lack of consistency. On the other hand, the sample solution started drying when the waiting time increased up to 5 min.

A Study on the Performance Evaluation of Recirculation System for Individual Hot Water Supply System in Residential Buildings (주거건물의 개별급탕방식 환탕배관 적용에 따른 급탕성능 평가에 관한 연구)

  • Cha, Min-Chul;Yeo, Myoung-Souk;Seok, Ho-Tae
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.19 no.12
    • /
    • pp.857-864
    • /
    • 2007
  • In the current residential building, hot water supply system consumes the second largest energy in order to make the thermal comport condition of residential space. The more residential environment improves the more the demand for hot water and water consumption is increasing gradually. So this study examines the possibility of applying the recirculation for individual hot water supply system compared with the existing method for waiting time for hot water, wasted water and energy consumption. The results are as follows. (1) In case of recirculation system method the waiting time for hot water can be reduced up to $69\sim85%$ in spring and fall period and so dose up to $77\sim85%$ in winter period. (2) The total wasted water has a little change compared with the existing method which can make the total wasted water reduced about $77\sim86%$. (3) The efficiency of hot water supply system can be improved, if the method which blocks the inflow of cold water is applied, when return pump is operated to recirculate hot water in recirculation system.

Evaluation of Patients' Queue Environment on Medical Service Using Queueing Theory (대기행렬이론을 활용한 의료서비스 환자 대기환경 평가)

  • Yeo, Hyun-Jin;Bak, Won-Sook;Yoo, Myung-Chul;Park, Sang-Chan;Lee, Sang-Chul
    • Journal of Korean Society for Quality Management
    • /
    • v.42 no.1
    • /
    • pp.71-79
    • /
    • 2014
  • Purpose: The purpose of this study is to develop the methods for evaluating patients' queue environment using decision tree and queueing theory. Methods: This study uses CHAID decision tree and M/G/1 queueing theory to estimate pain point and patients waiting time for medical service. This study translates hospital physical data process to logical process to adapt queueing theory. Results: This study indicates that three nodes of the system has predictable problem with patients waiting time and can be improved by relocating patients to other nodes. Conclusion: This study finds out three seek points of the hospital through decision tree analysis and substitution nodes through the queueing theory. Revealing the hospital patients' queue environment, this study has several limitations such as lack of various case and factors.

Hybrid Multicast/Broadcast Algorithm for Highly-Demanded Video Services with Low Complexity (Highly-Demanded 비디오 서비스를 위한 낮은 복잡도의 혼합 멀티캐스트/브로드캐스트 알고리즘)

  • Li, Can;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.101-110
    • /
    • 2011
  • With the deployment of broadband networking technology, many clients are enabled to receive various Video on Demand (VoD) services. To support many clients, the network should be designed by considering the following factors: viewer's waiting time, buffer requirement at each client, number of channel required for video delivery, and video segmentation complexity. Among the currently available VoD service approaches, the Polyharmonic and Staircase broadcasting approaches show best performance with respect to each viewer's waiting time and buffer requirement, respectively. However, these approaches have the problem of dividing a video into too many segments, which causes very many channels to be managed and used at a time. To overcome this problem, we propose Polyharmonic-Staircase-Staggered (PSS) broadcasting approach that uses the Polyharmonic and Staircase approaches for the head part transmission and the Staggered approach for the tail part transmission. It is simple and bandwidth efficient. The numerical results demonstrate that our approach shows viewer's waiting time is comparable to that in the Harmonic approach with a slight increase in the bandwidth requirement, and saves the buffer requirement by about 60\% compared to the Harmonic broadcasting approach by simply adjusting the video partitioning coefficient factor. More importantly, our approach shows the best performance in terms of the number of segments and the number of channels managed and used simultaneously, which is a critical factor in real operation of VoD services. Lastly, we present how to configure the system adaptively according to the video partitioning coefficient.

THE DISCRETE-TIME ANALYSIS OF THE LEAKY BUCKET SCHEME WITH DYNAMIC LEAKY RATE CONTROL

  • Choi, Bong-Dae;Choi, Doo-Il
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.3
    • /
    • pp.603-627
    • /
    • 1998
  • The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

  • PDF

M/PH/1 QUEUE WITH DETERMINISTIC IMPATIENCE TIME

  • Kim, Jerim;Kim, Jeongsim
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.383-396
    • /
    • 2013
  • We consider an M/PH/1 queue with deterministic impatience time. An exact analytical expression for the stationary distribution of the workload is derived. By modifying the workload process and using Markovian structure of the phase-type distribution for service times, we are able to construct a new Markov process. The stationary distribution of the new Markov process allows us to find the stationary distribution of the workload. By using the stationary distribution of the workload, we obtain performance measures such as the loss probability, the waiting time distribution and the queue size distribution.

Analysis for Authentication waiting time in Hand-over using Queueing Model (큐잉 모델을 이용한 핸드오버 시 인증 대기시간 분석)

  • Shin Seung-Soo;Kim Duck-Sool
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.123-132
    • /
    • 2005
  • In this paper, a conventional key exchange method simply Performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Proposed hand-over method shows reduced hand-over processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in authentication waiting time.

  • PDF

Variance of waiting time in the priority scheme of token bus protocols (토큰버스 프로토콜의 우선순위기능에서 대시시간의 분산)

  • Hong, Seung-Ho
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.5
    • /
    • pp.42-53
    • /
    • 1995
  • Token bus protocols have been sidely accepted for Medium Access Control (MAC) in real-time networks such as those used in factory automation, distributed process control, nuclear power plant, aircraft and spacecraft. Token bus protocols provide timer-controlled priority mechanism, which offers multiple level of privilege of medium access to different type of traffic. This paper presents and approximate analytical model for the evaluation of variance of waiting time in the time-controlled proiority scheme of token bus protocols. Token bus system is assumed to be operated with singe-service discipline which is the practical case of real-time networks such as those used in distributed process control and factory automations. The approximate analytical model is validated by comparison with the simulation resuls.

  • PDF

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
    • /
    • v.27 no.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.