• 제목/요약/키워드: Waiting

검색결과 1,612건 처리시간 0.025초

치과 의료소비자의 대기시간과 병원이미지 및 환자만족도간의 융합적 연구 (The Convergence Research on Waiting Time, Hospital Image, and Patient satisfaction in Dental Care Consumers)

  • 지민경;이미라
    • 융합정보논문지
    • /
    • 제8권4호
    • /
    • pp.27-35
    • /
    • 2018
  • 본 연구는 일부 치과 의료소비자들의 대기시간에 대한 반응과 병원이미지 및 환자만족도와의 관계를 파악하여 의료서비스의 질적 대기환경관리를 위한 기초자료를 제공하고자 시도되었다. 연구대상은 치과 병 의원에 내원한 대기시간을 경험한 성인으로 하였고, 2016년 5월 16일부터 6월 18일까지 구조화된 무기명 자기기입식 설문조사를 실시하였다. 병원이미지는 장시간 대기 시 치과 의료기관 신뢰도 변화, 재이용의사 변화, 예약시스템, 환자만족도는 성별, 예상 대기시간설명, 장시간 대기 시 치과 의료기관 신뢰도 변화, 재이용의사 변화, 예약시스템과 관련이 있었다. 대기시간에 대한 긍정적 반응과 병원이미지, 환자만족도는 양의 상관관계로 나타났고, 부정적 반응은 병원이미지, 환자만족도와 음의 상관관계를 나타났으며, 병원 이미지와 환자만족도는 양의 상관관계를 나타냈다. 병원이미지 제고와 환자만족도 향상을 위한 실제적인 접근방안이 요구되며, 대기의 불안과 부정적 반응을 해소 할 수 있는 IT기술 및 여러 컨텐츠를 접목한 대기환경의 변화가 필요하다고 사료된다.

보행대기시간과 보행자스트레스를 고려한 보행자우선 감응신호 운영방안 연구 (A Study on Pedestrian Priority Actuated Signal Control Considering Waiting Time for Walking and Pedestrian Stress)

  • 최봉수;남두희
    • 한국ITS학회 논문지
    • /
    • 제21권4호
    • /
    • pp.18-29
    • /
    • 2022
  • 주도로 차량 위주의 좌회전감응신호운영은 보행대기시간은 더 늘어날 수 있기 때문에 이는 보행자의 불편 또는 스트레스를 유발하고 있는 실정이다. 따라서 본 연구에서는 좌회전감응신호 적용 전·후의 보행대기시간과 설문조사를 통해 보행자가 느끼는 스트레스를 살펴보았으며 이를 개선하기 위하여 보행자우선 감응신호 시뮬레이션(VISSIM) 분석을 하였다. 좌회전감응신호 적용 후 보행대기시간은 비첨두시간에 37% 증가했다. 설문 결과 보행대기시간이 길어졌다가 62.1%, 그 중 78%는 그로 인하여 스트레스를 받는거로 나타났다. 한편 보행자우선 감응신호 시뮬레이션(VISSIM) 분석 결과, 차량 통행속도는 1.07km/h(2.5%)로 소폭 감소한 반면 보행 평균대기시간은 15.51초(28%) 감소하여 크게 개선되었다. 따라서 보행자우선 감응신호는 보행 대기시간을 감소시켜 보행자 스트레스를 완화할 수 있을 것으로 기대한다.

(Max, +)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석 (Application of (Max, +)-algebra to the Waiting Times in Deterministic 3-node Tandem Queues with Blocking)

  • 서동원
    • 한국경영과학회지
    • /
    • 제30권2호
    • /
    • pp.73-80
    • /
    • 2005
  • In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

3-노(盧)드 유한 버퍼 일렬대기행렬에서의 최적 버퍼 크기에 대한 분석 (Analysis of Optimal Buffer Capacities in 3-node Tandem Queues with Blocking)

  • 서동원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
    • /
    • pp.881-889
    • /
    • 2005
  • In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

  • PDF

The Analysis of the M/M/1 Queue with Impatient Customers

  • Lee, EuiYong;Lim, Kyung Eun
    • Communications for Statistical Applications and Methods
    • /
    • 제7권2호
    • /
    • pp.489-497
    • /
    • 2000
  • The M/M/1 queue with impatient customers is studied. Impatient customers wait for service only for limited time K/0 and leave the system if their services do not start during that time. Notice that in the analysis of virtual waiting time, the impatient customer can be considered as the customer who enters the system only when his/her waiting time does not exceed K. In this paper, we apply martingale methods to the virtual waiting time and obtain the expected period from origin to the point where the virtual waiting time crosses over K or reaches 0, and the variance of this period. With this results, we obtain the expected busy period of the queue, the distribution, expectation and variance of the number of times the virtual waiting time exceeding level K during a busy period, and the probability of there being no impatient customers in a busy period.

  • PDF

자동창고의 저장 및 불출요구의 대기시간에 관한 연구 (Expected Waiting Times for Storage and Retrieval Requests in Automated Storage and Retrieval Systems)

  • 조면식
    • 대한산업공학회지
    • /
    • 제30권4호
    • /
    • pp.306-316
    • /
    • 2004
  • We present a closed form approximate analytical model to estimate the expected waiting times for the storage and retrieval requests of an automated storage/retrieval (AS/R) system, assuming that the storage/retrieval (S/R) machine idles either at the rack or at the input/output point. The expected waiting times (and the associated mean queue lengths) can play an important role to decide whether the performance of a stable AS/R system is actually acceptable, to determine buffer size (or length) of the input conveyor, and to compute the number of the rack openings which is required to hold the loads which are requested by processing machines but waiting in the rack to be retrieved by the SIR machine. This model can be effectively used in the early design stage of an AS/R system.

확률적 순서를 이용한 대기행렬 망에서 안정 대기시간의 범위 (Bounds for Stationary Waiting Times in a Class of Queueing Networks using Stochastic Ordering)

  • 서동원
    • 한국경영과학회지
    • /
    • 제29권4호
    • /
    • pp.1-10
    • /
    • 2004
  • In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

종합병원 외래진료부의 대기공간 구성에 관한 연구 - 외래 이용환자의 대기형태를 중심으로 - (A Study on the Spatial Characteristics of Waiting Areas in General Hospital - focusing on the behavior of out-patient -)

  • 노윤희
    • 한국실내디자인학회:학술대회논문집
    • /
    • 한국실내디자인학회 1999년도 춘계학술발표대회 논문집
    • /
    • pp.45-48
    • /
    • 1999
  • The objective of this study is to introduce the spatial characteristics and the better arrangement of waiting areas in general hospital on comprehensing the patient's behavior as patient call-system and spatial characteristics is characteristics is changed. That is for improvement in the circumstance of waiting area more important than before, and for the patient satisfaction and patient's affirmative judgement of hospital quality by offering the convenience. Through this study, the way of improvement for waiting area can be suggested such as the beeper system, the restructuring of program information, the multiple aim space without hospital program, the reform of the seat's arrayal, the waiting area with conveniency.

  • PDF

(Max, +)-대수를 이용한 2-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석 (Application of (Max, +)-algebra to the Waiting Times in Deterministic 2-node Tandem Queues with Blocking)

  • 서동원
    • 한국경영과학회지
    • /
    • 제30권1호
    • /
    • pp.149-159
    • /
    • 2005
  • In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

How Background Music Affects Consumer Perception of Waiting Time? -A Mediating Role of Emotions-

  • Park, Jee-Sun;Stoel, Leslie D.
    • 패션비즈니스
    • /
    • 제22권3호
    • /
    • pp.16-29
    • /
    • 2018
  • The present study examines whether consumers' perception of waiting time and their behavioral intentions are influenced by the presence of background music in an online shopping environment. In particular, this study aims to explain the underlying mechanism for the effects of background music on consumers' perceived wait and behavioral intentions toward the online retailer by proposing the mediating role of emotions drawing on the Stimulus-Organism-Response (S-O-R) framework. A lab experiment was employed to test the hypotheses. A total of 102 college students were used for data analyses. Results show that the presence of music has a significant impact on participants' emotions, perceived waiting time, and approach behavior. Moreover, the findings show that pleasure and the perceived waiting time serve as mediators in the relationship between the presence of music and approach behavior. Implications of the model for theory, practice, and further research are discussed.