• Title/Summary/Keyword: Queueing Models

Search Result 105, Processing Time 0.024 seconds

A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps

  • Oh, Youngjin;Kim, Chesoong;Melikov, Agassi
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.274-280
    • /
    • 2013
  • This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.

A Note on Common Mistakes about Stopped Random Sums Arising in Queueing Models (대기행렬 모형에서 틀리기 쉬운 정지랜덤합에 관한 소고)

  • Chae, Kyung-C.;Park, Hyun-M.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.381-386
    • /
    • 1998
  • We frequently encounter stopped random sums when modelling queueing systems. We also notice occasional mishandling of stopped random sums in the literature. The purpose of this note is to prevent further mistakes by identifying and correcting typical mistakes about stopped random sums. As an example model, we use the two-phase M/G/1 queue with multiple vacations.

  • PDF

The Optimal Staffing Problem at the Reservation Call Center in the Hospital (진료예약콜센터의 인력 배치 최적화 연구)

  • Kim, Seong-Mun;Na, Jeong-Eun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.493-505
    • /
    • 2006
  • Call center staffing problems have often relied upon queueing models, which are traditionally used to compute average call waiting time. However, the relationship between the in-bound call volume and call abandon rate is not directly explained even with the complex queueing formula while that relationship is a major interest to the hospital due to profitability. In this paper we provide a novel approach for the call center staffing problem by incorporating the relationship between the in-bound call volume and call abandon rate with a nonlinear integer programming, rather than using the traditional queueing model. We perform numerical analyses with actual data obtained from a reservation call center in a hospital.

  • PDF

Finite Source Queueing Models for Analysis of Complex Communication Systems (복잡한 통신 시스템의 성능분석을 위한 유한소스 대기 모형)

  • Che-Soong Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.2
    • /
    • pp.62-67
    • /
    • 2003
  • This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

A Study on the Design of the Radar Data Integrating System (레이다 정보처리용 통합 정보처리 시스템 셜계에 관한 연구)

  • 이상웅;최진일;라극환;양기덕;조동래
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.5
    • /
    • pp.798-811
    • /
    • 1995
  • In this study, radar data integrating and processing systems were designed for the data processing of various information from many kinds of radar in a single data processing system. The characteristics of the data integrating system were analyzed by the system simulation with the queueing theory. The designed data integrating systems can be divided into a centralized and a distributed type. In the system structure, we used UNIX message que as the real time processor and the queueing theory for the performance evaluation of the information flow in the systems. For the analysis of the performance of inforamtion flow in both models, queueing theory was applied to and implemented with the simulation package, OPNET system and C language. From the simulation result we could understand the system factors which effect the system performance and characteristics on the data processing.

  • PDF

Analysis of ISUP signalling Delay in Common Channel Signaling System (공통선 신호 시스템의 ISDN 사용자부 신호 지연 분석)

  • 박철근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1377-1386
    • /
    • 2000
  • As all delays resulting from the signaling network directly affect the response time of network management activity, all control informations have to be transported most efficiently. It is very important to know the performance of the signaling system not only because of smooth network operation but also because of efficient engineering of signaling networks. In this paper, we analyzed mean queueing delay of signaling link for ISUP signaling messages in common channel signaling system by using M[X]/G/1 and M[X]/D/1 batch arrival queueing system. This is because we modeled arrival process of the signaling messages as batch arrival process considering that many kinds of signaling messages are generated at short intervals when a call requests a connection. Analysis was carried out considering different call processing scenario based on ITU-T specification. We also described the numerical results from the different types of queueing models.

  • PDF

Determining the Proper Capacity of Electric Vehicle Charging Station (전기자동차 충전소의 적정 용량 결정)

  • Hong, Jun-Hee;Choi, Jung-In;Lee, Jong-Hyun;Nam, Young-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.10
    • /
    • pp.1911-1915
    • /
    • 2009
  • The problem of determining the proper capacity of electric vehicle charging station is studied in the presented paper. Based on the expected arrival rate and the expected charging time, we calculate the proper capacity that guarantees electric vehicles get service better than a given lower bound which is termed the loss of charging probability. The problem is studied by using certain queueing models. We first formulate the problem as a queueless model of type M/M/n/n, known as the Erlang loss system. And then the M/M/n/K type queueing model is formulated to consider the parking space constraint. Results of the study may be used for designing the electric vehicle charging station.

Control Models for Queueing Systems Using Stochastic Petri Nets (추계적 페트리 네트를 이용한 대기시스템의 제어모형)

  • Lee, Kwang-Sik;Lee, Hyo-Seong
    • IE interfaces
    • /
    • v.8 no.2
    • /
    • pp.161-169
    • /
    • 1995
  • In this paper, a threshold policy is considered for the Markovian queueing system with server vacations. The threshold policy considered in this paper has the following form: "when the number of customers present in the system increases to N, the server is turned on and serves customers until the system becomes empty". In this paper, we show how the finite capacity or finite population queueing system under a threshold policy can be modeled by the stochastic Petri net. The performance evaluation of the model is carried out using the software called "SPNP". Some examples are also presented in which it is shown that how the optimal threshold policies can be obtained under a linear cost structure.

  • PDF

A Study on Modeling of FMS using Closed Queueing Network (폐쇄형 대기행렬 네트워크에 의한 FMS 모델링)

  • Jeong, Seok-Chan;Cho, Kyu-Kab
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.153-165
    • /
    • 1995
  • Many closed queueing network models have been used as an effective tool to make a preliminary design of FMS. Although a loading/unloading function is an important factor to effect the utilization and throughput of FMS as well as a transfer function and a processing function, the Solberg's model did not clarify the loading/unloading function. In this paper, we propose a closed queueing network model for analyzing a flexible manufacturing system that consists of a load/unload station, a material handling system and a group of workstations for processing jobs, and define the expected utilization and the expected throughput of the FMS. As applications of the proposed model, the cases of a material handling system consisting of a conveyor and the FMS including an inspection station are also formulated.

  • PDF

COMPARISON OF DISCRETE TIME INVENTORY SYSTEMS WITH POSITIVE SERVICE TIME AND LEAD TIME

  • Balagopal, N;Deepthy, CP;Jayaprasad, PN;Varghese, Jacob
    • Korean Journal of Mathematics
    • /
    • v.29 no.2
    • /
    • pp.371-386
    • /
    • 2021
  • This paper investigates two discrete time queueing inventory models with positive service time and lead time. Customers arrive according to a Bernoulli process and service time and lead time follow geometric distributions. The first model under discussion based on replenishment of order upto S policy where as the second model is based on order placement by a fixed quantity Q, where Q = S - s, whenever the inventory level falls to s. We analyse this queueing systems using the matrix geometric method and derive an explicit expression for the stability condition. We obtain the steady-state behaviour of these systems and several system performance measures. The influence of various parameters on the systems performance measures and comparison on the cost analysis are also discussed through numerical example.