• Title/Summary/Keyword: Arrival Management

Search Result 343, Processing Time 0.023 seconds

On the Modified Supplementary Variable Technique for the Discrete-Time GI/G/1/K Queue (이산시간 GI/G/1/K 대기행렬에 대한 수정부가변수법)

  • Chae, Kyung-Chul;Lee, Doo-Ho;Kim, Nam-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.1
    • /
    • pp.107-115
    • /
    • 2008
  • We consider the discrete-time GI/G/1/K queue under the early arrival system. Using a modified supplementary variable technique(SVT), we obtain the distribution of the steady-state queue length. Unlike the conventional SVT, the modified SVT yields transform-free results in such a form that a simple two-moment approximation scheme can be easily established.

A study on shortest problem between specified nodes with multiple travel time (다수개의 여행시간이 주어진 경우의 지정된 마디간의 최단경로 문제)

  • 이명석;박순달
    • Korean Management Science Review
    • /
    • v.7 no.2
    • /
    • pp.51-57
    • /
    • 1990
  • The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

  • PDF

A performance analysis of AS/RS with single and dual commands (단일 및 이중명령을 수행하는 자동창고 시스템의 성능분석)

  • Nam Jin Gyu;Jeong Jae Ho;Heo Seon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.244-246
    • /
    • 2003
  • We consider an AS/RS(Automated Storage/ Retrieval System) which performs single and dual commands. In this paper, we also assume that the service times of single and dual commands are differently distributed. We transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of a AS/RS, and obtain approximated means of queue lengths and sojourn times.

  • PDF

국제전화 콜백서비스의 생성원인과 경제효과 분석

  • 최현우;윤경림;김인준
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.10a
    • /
    • pp.182-185
    • /
    • 1996
  • This paper analyzes how the international callback services affect on the international telecommunications market. We present a simple game-theoretic model to compare the equilibrium outcomes before and after the arrival of callback operator. We find that the callback service arises from the inefficiencies in the national telecommunications market and the accounting rate system between international telecommunications carriers. Also, we identify the conflicting interests among the governments and carriers, by examining how the callback service affects the collection rate, quantities demanded, carrier's profit and social welfare of each country.

  • PDF

D-MAP 도착과정을 갖는 이산시간 대기행렬모형에서의 분포적 Little의 법칙과 D-MAP/D/c 모형에의 응용

  • Kim Nam-Gi
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1101-1103
    • /
    • 2006
  • For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

  • PDF

Types of Train Delay of High-Speed Rail : Indicators and Criteria for Classification (고속철도 열차지연 유형의 구분지표 및 기준)

  • Kim, Hansoo;Kang, Joonghyuk;Bae, Yeong-Gyu
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.3
    • /
    • pp.37-50
    • /
    • 2013
  • The purpose of this study is to determine the indicators and the criteria to classify types of train delays of high-speed rail in South Korea. Types of train delays have divided into the chronic delays and the knock-on delays. The Indicators based on relevance, reliability, and comparability were selected with arrival delay rate of over five minutes, median of arrival delays of preceding train and following train, knock-on delay rate of over five minutes, correlation of delay between preceding train and following train on intermediate and last stations, average train headway, average number of passengers per train, and average seat usages. Types of train delays were separated using the Ward's hierarchical cluster analysis. The criteria for classification of train delay were presented by the Fisher's linear discriminant. The analysis on the situational characteristics of train delays is as follows. If the train headway in last station is short, the probability of chronic delay is high. If the planned running times of train is short, the seriousness of chronic delay is high. The important causes of train delays are short headway of train, shortly planned running times, delays of preceding train, and the excessive number of passengers per train.

A Construction and Operation Analysis of Group Management Network about Control Devices based on CIM Level 3 (CIM 계층 3에서 제어 기기들의 그룹 관리 네트워크 구축과 운영 해석)

  • 김정호
    • The Journal of Society for e-Business Studies
    • /
    • v.4 no.1
    • /
    • pp.87-101
    • /
    • 1999
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

  • PDF

The Architecture of an Intelligent Digital Twin for a Cyber-Physical Route-Finding System in Smart Cities

  • Habibnezhad, Mahmoud;Shayesteh, Shayan;Liu, Yizhi;Fardhosseini, Mohammad Sadra;Jebelli, Houtan
    • International conference on construction engineering and project management
    • /
    • 2020.12a
    • /
    • pp.510-519
    • /
    • 2020
  • Within an intelligent automated cyber-physical system, the realization of the autonomous mechanism for data collection, data integration, and data analysis plays a critical role in the design, development, operation, and maintenance of such a system. This construct is particularly vital for fault-tolerant route-finding systems that rely on the imprecise GPS location of the vehicles to properly operate, timely plan, and continuously produce informative feedback to the user. More essentially, the integration of digital twins with cyber-physical route-finding systems has been overlooked in intelligent transportation services with the capacity to construct the network routes solely from the locations of the operating vehicles. To address this limitation, the present study proposes a conceptual architecture that employs digital twin to autonomously maintain, update, and manage intelligent transportation systems. This virtual management simulation can improve the accuracy of time-of-arrival prediction based on auto-generated routes on which the vehicle's real-time location is mapped. To that end, first, an intelligent transportation system was developed based on two primary mechanisms: 1) an automated route finding process in which predictive data-driven models (i.e., regularized least-squares regression) can elicit the geometry and direction of the routes of the transportation network from the cloud of geotagged data points of the operating vehicles and 2) an intelligent mapping process capable of accurately locating the vehicles on the map whereby their arrival times to any point on the route can be estimated. Afterward, the digital representations of the physical entities (i.e., vehicles and routes) were simulated based on the auto-generated routes and the vehicles' locations in near-real-time. Finally, the feasibility and usability of the presented conceptual framework were evaluated through the comparison between the primary characteristics of the physical entities with their digital representations. The proposed architecture can be used by the vehicle-tracking applications dependent on geotagged data for digital mapping and location tracking of vehicles under a systematic comparison and simulation cyber-physical system.

  • PDF

Clinical Analysis of Death in Trauma Patients (외상으로 인한 사망 환자의 임상적 분석)

  • Kim, Whan Sik;Cho, Min Su;Bae, Keum Seok;Kang, Seong Joon;Lee, Kang Hyun;Hwang, Keum;Oh, Jin Rok;Park, Il Hwan
    • Journal of Trauma and Injury
    • /
    • v.20 no.2
    • /
    • pp.96-100
    • /
    • 2007
  • Purpose: Trauma is the 5th most common leading cause of death in Korea, but there has been no appropriate management system for patients until now. We analyzed the main causes of death in trauma patients by comparing the characteristics of those patients with the characteristics of patients who survived. We feel this analysis should have a positive effect on the development of an appropriate trauma management system in Korea. Methods: We retrospectively reviewed trauma patients who had been admitted to the Department of General Surgery from February 2002 to February 2007. We compared several expected risk factors between the mortality and the survival group. Data on the transportation, arrival time at the emergency center, amount of transfusion, initial shock index, cause of death, and initial physical condition according to RTS (Revised trauma score), ISS (Injury severity score) and TRISS (Trauma and Injury Severity Score) were collected. Patients with ISS lower than 12 were excluded. Results: Three hundred sixty-six(366) patients with multiple injuries were included. There were 40 patients in the mortality group and 326 patients in the survival group. The mean arrival time (minutes) to emergency center was longer in the mortality group (137.6 vs 93.6 p 0.04). The total amount of transfusion (ml) was larger in the mortality group (7139 vs 2470 p 0.01). The initial shock index was higher in the mortality group (1.45 vs 1.17 p<0.01). The RTS, ISS, and TRISS were not statistically different between the groups. In the multivariate analysis, mean arrival time and initial shock index were important factors for survival. Conclusion: If the mortality rate of trauma patients is to be reduced, the arrival time at the emergency center should be minimized. Improvement of the emergency medical transfer service system is very important for achieving that.

Dynamically Adaptable Mobile Agents for Scaleable Software and Service Management

  • Brandt, Raimund;Hortnag, Chistian;Reiser, Helmut
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.307-316
    • /
    • 2001
  • Two hard sub-problems have emerged relating to the use of mobile agents for service management tasks. First, what is their impact on security, and second, how can they receive a flexible capacity to adapt to an open range of different environments on demand, without introducing trio stringent prior assumptions. In this paper, we present work towards solving the second problem, which is of particular interest to management software, because it typically needs to excert fine-grained and therefore particular resource control. We suggest a mechanism that reassembles mobile agents from smaller sub-components during arrival at each hop. The process incorporates patterns of unmutable and mutable sub-components, and is informed by the conditions of each local environment. We discuss different kinds of software adaptation and draw a distinction between static and continuous forms. Our software prototype for dynamic adaptation provides a concept far exchanging environment-dependent implementations of mobile agents during runtime. Dynamic adaptation enhances efficiency of mobile code in terms of bandwidth usage and scalability.

  • PDF