• Title/Summary/Keyword: wait time

Search Result 207, Processing Time 0.032 seconds

Efficient Scheduling of Sensor-based Elevator Systems in Smart Buildings (스마트 빌딩을 위한 센서 기반의 효율적인 엘리베이터 스케줄링)

  • Bahn, Hyokyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.10
    • /
    • pp.367-372
    • /
    • 2016
  • In a modern smart building, sensors can detect various physical conditions, such as temperature, humidity, sound, motion, and light, which can be used in medical services and security, and for energy savings. This paper presents an efficient elevator scheduling system that utilizes smart sensor technologies with radio-frequency identification, video, and floor sensors to detect the arrival of elevator users in advance. The detected information is then delivered to the elevator scheduling system via building networks. By using this information, the proposed system makes a reservation call for efficient control of the elevator's direction and time. Experiments under a spectrum of traffic conditions show that the proposed system performs better than a legacy system with respect to average wait time, maximum wait time, and energy consumption.

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

  • Lee, EuiYong;Lim, Kyung Eun
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.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

Performance Analysis of Double-layered ARQ

  • Uhm, Yong-Hun;Park, Cheon-Won
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.85-88
    • /
    • 2001
  • In this paper, we propose a retransmission based error control scheme in which a stop-and-wait ARQ is simultaneously performed in two adjacent layers for the node-to-node error control. We develop an analytical numerical method to calculate the probability of error remains and the moments of the high layer message delay time at steady state. Using the analytical method, we investigate the performance of double-layered ARQ scheme with respect to the properties of the employed CRC codes and the characteristics of the involved channel.

  • PDF

Performance Evaluation Model for Twin Fork AS/RS (Twin Fork 자동창고의 성능 평가 모형)

  • 김성태;김재연
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.16 no.28
    • /
    • pp.39-47
    • /
    • 1993
  • In this paper, We develop performance evaluation model for Twin fork Automated Storage/Retrieval systems. The system is modeled as a modified bulk service queueing system consisting of one exponential server with limited system capacity. The differance between this model and general bulk service queueing model is the inequality of transition service rate of each stage. The ejective of this model is to provide system characteristics for Twin fork AS/R system design problems, which are the number of customers in system, wait time in system and queue, the system queue size.

  • PDF

Performance Analysis of M/$E_k$/c/N Time-out Queueing System (타임아웃이 있는 M/$E_k$/c/N 대기시스템의 성능분석)

  • Ryu, Ji-Hyun;Jun, Chi-Hyuck
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.89-94
    • /
    • 2001
  • There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.

  • PDF

A Solution of the Bicriteria Vehicle Routing Problems with Time Window Constraints (서비스시간대 제약이 존재하는 2기준 차량경로문제 해법에 관한 연구)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.183-190
    • /
    • 1998
  • This paper is concerned with the bicriteria vehicle routing problems with time window constraints(BVRPTW). The BVRPTW is to determine the most favorable vehicle routes that minimize the total vehicle travel time and the total customer wait time which are, more often than not, conflicting. We construct a linear goal programming (GP) model for the BVRPTW and propose a heuristic algorithm to relieve a computational burden inherent to the application of the GP model. The heuristic algorithm consists of a parallel insertion method for clustering and a sequential linear goal programming procedure for routing. The results of computational experiments showed that the proposed algorithm finds successfully more favorable solutions than the Potvin an Rousseau's method that is known as a very good heuristic for the VRPs with time window constraints, through the change of target values and the decision maker's goal priority structure.

  • PDF

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

  • Park, Jee-Sun;Stoel, Leslie D.
    • Journal of Fashion Business
    • /
    • v.22 no.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.

A Simulation Model of a Outpatient Scheduling System (외래환자의 예약제도 개선을 위한 시뮬레이션 모형)

  • Chun, Ki-Hong;Chae, Young-Moon
    • Journal of Preventive Medicine and Public Health
    • /
    • v.19 no.1 s.19
    • /
    • pp.56-64
    • /
    • 1986
  • This paper describes a GPSS-based, multi-server queueing model that was developed to simulate the patient flow, and to analyze the effectiveness of the patient scheduling system under various conditions. Unpredictable and unacceptably long waits to receive the service at the outpatient department of a general hospital necessitated the study. Arrival and service time distribution needed for the simulation model were generated from actual arrival and service patterns observed during the peak hours. The simulation results show that a change in patient scheduling system (i.e. time interval between appointments, starting time. and the number of physicians) from a current system would significantly reduce the patient wait time. This study provides the hospital administrator with an analysis of patient scheduling system under several conditions, and will be used to plan future scheduling system and staffing. Studies such as this can demonstrate the value of simulation in providing information for use in future planning.

  • PDF

A Study on the Delivery Policy of Internet Bookstores (인터넷 서점의 배송정책에 관한 연구)

  • Kim, Ji-Pyo;Hong, Soon-Hyuk
    • IE interfaces
    • /
    • v.16 no.spc
    • /
    • pp.33-38
    • /
    • 2003
  • In this paper we study the delivery policy of internet bookstores and recommend the improved policy to increase customer satisfaction and sales revenue. We classify customers into two, the price-sensitive and the delivery time-sensitive, and develop a new shipping method, the unhurried shipping, for the price-sensitive who are reluctant to pay shipping fee for the small purchase but willing to wait extra time for the ordered goods. The customers could get discount on shipping fee by the unhurried shipping but have to accept the longer delivery lead-time. We investigate the possible ways to reduce costs with the prolonged delivery time and show that some costs regarding shipmentand inventory could be saved in order to make up for additional shipping costs for the price-sensitive.

QuTFTP: Quick UDP Trivial File Transfer Protocol (QuTFTP: UDP 기반의 빠른 파일전송)

  • Kim, Byoung-Kug
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.5
    • /
    • pp.438-443
    • /
    • 2020
  • To transfer files between nodes on network based on Ethernet, file transfer protocol (FTP) on TCP/IP and trivial file transfer protocol (TFTP) on UDP/IP are mostly used. Due to the lack of resources (processor, memory and so on) in the embedded system where we generally use for simple works with small firmware like ones; many of the systems implement only UDP/IP for their network stacks. Thus, TFTP is greatly to be preferred. For examples, environmental sensor devices for sensor networks, Boot Loader for general embedded device and preboot execution environment (PXE) boot for PC provide the TFTP. The logic of TFTP is simple for file transmission but, there is Stop-And-Wait problem during the process which occurs long blocking time. In this paper, we propose an algorithm which called QuTFTP(Quick UDP Trivial File Transfer Protocol) to reduce the length of the blocking time and to be compatible with the legacy TFTP.