• Title/Summary/Keyword: Waiting Times

Search Result 206, Processing Time 0.021 seconds

The Effect of the Perceived Waiting Time of Viewers on Negative Emotions, Viewing Satisfaction, Viewing Attitude, and Continuous Viewing Intention When an e-Sports Game Pause

  • Juyeon Lee;Seyun Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.342-350
    • /
    • 2023
  • The purpose of this study is to find out how the perceived waiting time of viewers of e-sports games affects negative emotions and how these negative emotions affect viewing satisfaction, viewing attitude, and continuous viewing intention. To achieve the purpose of this study, 200 viewers who watched e-sports games more than two to three times were targeted. 197 copies were selected as the final valid sample after excluding three of the collected questionnaires that showed unfaithful answers. For data processing methods, confirmatory factor analysis, reliability analysis, and structural equation model analysis were conducted using SPSS 27 and AMOS 25. Through this, the following results were obtained. First, it was found that the perceived waiting time of the viewer had a significant effect on the viewers' negative emotions in the event of a game pause. Second, viewers' negative emotions were found to have a significant effect on viewing attitudes, but not on viewing satisfaction. Third, it was found that viewing attitude had a significant effect on viewing satisfaction and continuous viewing intention. Fourth, it was found that viewing satisfaction had a significant effect on continuous viewing intention. In other words, the more acceptable and shorter the perceived waiting time due to the suspension of the game pause, the lower the negative emotions of the viewers, and the negative emotions of the viewers ultimately affect the intention to continue watching through viewing attitude and viewing satisfaction.

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

Waiting Times in Priority Polling Systems with Batch Poisson Arrivals

  • Ryu, W.;Jun, K.P.;Kim, D.W.;Park, B.U.
    • Communications for Statistical Applications and Methods
    • /
    • v.5 no.3
    • /
    • pp.809-817
    • /
    • 1998
  • In this paper we consider a polling system where the token is passed according to a general service order table. We derive an exact and explicit formula to compute the mean waiting time for a message when the arrivals of messages are modeled by batch Poisson processes.

  • PDF

Waiting Times in Polling Systems with Markov-Modulated Poisson Process Arrival

  • Kim, D. W.;W. Ryu;K. P. Jun;Park, B. U.;H. D. Bae
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.3
    • /
    • pp.355-363
    • /
    • 1997
  • In queueing theory, polling systems have been widely studied as a way of serving several stations in cyclic order. In this paper we consider Markov-modulated Poisson process which is useful for approximating a superposition of heterogeneous arrivals. We derive the mean waiting time of each station in a polling system where the arrival process is modeled by a Markov-modulated Poisson process.

  • PDF

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

  • Song, Jung-Hup
    • Quality Improvement in Health Care
    • /
    • v.2 no.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

Integrated Model of Inventory and Waiting Time in EV Battery Switching Stations (배터리 교체식 전기차의 배터리 재고-차량 대기시간 통합모형)

  • Seo, Yong Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.4
    • /
    • pp.51-65
    • /
    • 2012
  • Battery switching EVs are considered to be a promising alternative to overcome long charging time problems in the EV adoption. The purpose of this research is to develop integrated model for battery inventory and battery switching waiting times. Due to complexity of exact analysis, a practical approximation method is developed, which provides close results to exact values. Numerical experiments show that there exist trade-offs between the battery inventory level and the number of switching stations. The proposed model can be applied to evaluate and select the minimum cost alternative in implementing the battery switching stations.

A Scheduling Algorithm for Workstations with Limited Waiting Time Constraints in a Semiconductor Wafer Fabrication Facility (대기시간 제약을 고려한 반도체 웨이퍼 생산공정의 스케쥴링 알고리듬)

  • Joo, Byung-Jun;Kim, Yeong-Dae;Bang, June-Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.4
    • /
    • pp.266-279
    • /
    • 2009
  • This paper focuses on the problem of scheduling wafer lots with limited waiting times between pairs of consecutive operations in a semiconductor wafer fabrication facility. For the problem of minimizing total tardiness of orders, we develop a priority rule based scheduling method in which a scheduling decision for an operation is made based on the states of workstations for the operation and its successor or predecessor operation. To evaluate performance of the suggested scheduling method, we perform simulation experiments using real factory data as well as randomly generated data sets. Results of the simulation experiments show that the suggested method performs better than a method suggested in other research and the one that has been used in practice.

Estimation of Channel Capacity for Data Traffic Transmission (데이터 트래픽 특성을 고려한 적정 채널 용량 산정)

  • Park, Hyun Min
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.589-595
    • /
    • 2017
  • We present an estimation model for optimal channel capacity required to data traffic transmission. The optimal channel capacity should be calculated in order to satisfy the permitted transmission delay of each wireless data services. Considering the discrete-time operation of digital communication systems and batch arrival of packet-switched traffic for various wireless services, $Geo^x$/G/1 non-preemptive priority queueing model is analyzed. Based on the heuristic interpretation of the mean waiting time, the mean waiting times of various data packets which have the service priority. Using the mean waiting times of service classes, we propose the procedure of determining the optimal channel capacity to satisfy the quality of service requirement of the mean delay of wireless services. We look forward to applying our results to improvement in wireless data services and economic operation of the network facilities.

Non-periodic Subway Scheduling that Minimizes Operational Cost and Passenger Waiting Time

  • Hong, YunWoo;Chung, Yerim;Min, YunHong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.8
    • /
    • pp.133-142
    • /
    • 2018
  • Subway metro scheduling is one of the most important problems impacting passenger convenience today. To operate efficiently, the Seoul metro uses regular, periodic schedules for all lanes, both north and southbound. However, many past studies suggest that non-periodic scheduling would better optimize costs. Since the Seoul metro is continuously facing a deficit, adopting a non-periodic schedule may be necessary. Two objectives are presented; the first, to minimize the average passengers' waiting time, and the second, to minimize total costs, the sum of the passenger waiting time, and the operational costs. In this paper, we use passenger smart card data and a precise estimation of transfer times. To find the optimal time-table, a genetic algorithm is used to find the best solution for both objectives. Using Python 3.5 for the analysis, for the first objective, we are able to reduce the average waiting time, even when there are fewer trains. For the second objective, we are able to save about 4.5 thousand USD with six fewer trains.

An IoT-Aware System for Managing Patients' Waiting Time Using Bluetooth Low-Energy Technology

  • Reham Alabduljabbar
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.83-92
    • /
    • 2024
  • It is a common observation that whenever any patient arrives at the front desk of a hospital, outpatient clinic, or other health-associated centers, they have to first queue up in a line and wait to fill in their registration form to get admitted. The long waiting time without any status updates is the most common complaint, worrying health officials. In this paper, UrNext, a location-aware mobile-based solution using Bluetooth low-energy (BLE) technology, is presented to solve the problem. Recently, a technology-oriented method has been gaining popularity in solving the healthcare sector's problems, namely the Internet of Things (IoT). The implementation of this solution could be explained through a simple example that when a patient arrives at a clinic for her consultation. There, instead of having to wait in long lines, she will be greeted automatically, receive a push notification telling her that she has been admitted along with an estimated waiting time for her consultation session. This will not only provide the patients with a sense of freedom but would also reduce uncertainty levels that are generally observed, thus saving both time and money. This work aimed to improve clinics' quality of services and organize queues and minimize waiting times in clinics, leading to patient comfortability and reducing the burden on nurses and receptionists. The results demonstrated that the presented system was successful in its performance and helped achieve high usability.