• 제목/요약/키워드: Single vacation

검색결과 19건 처리시간 0.022초

Balking Phenomenon in the $M^{[x]}/G/1$ Vacation Queue

  • Madan, Kailash C.
    • Journal of the Korean Statistical Society
    • /
    • 제31권4호
    • /
    • pp.491-507
    • /
    • 2002
  • We analyze a single server bulk input queue with optional server vacations under a single vacation policy and balking phenomenon. The service times of the customers as well as the vacation times of the server have been assumed to be arbitrary (general). We further assume that not all arriving batches join the system during server's vacation periods. The supplementary variable technique is employed to obtain time-dependent probability generating functions of the queue size as well as the system size in terms of their Laplace transforms. For the steady state, we obtain probability generating functions of the queue size as well as the system size, the expected number of customers and the expected waiting time of the customers in the queue as well as the system, all in explicit and closed forms. Some special cases are discussed and some known results have been derived.

A SINGLE SERVER RETRIAL QUEUE WITH VACATION

  • Kalyanaraman, R.;Murugan, S. Pazhani Bala
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.721-732
    • /
    • 2008
  • A single server infinite capacity queueing system with Poisson arrival and a general service time distribution along with repeated attempt and server vacation is considered. We made a comprehensive analysis of the system including ergodicity and limiting behaviour. Some operating characteristics are derived and numerical results are presented to test the feasibility of the queueing model.

  • PDF

2단계 서비스와 일반휴가 대기행렬 (Two-phase Queueing System with Generalized Vacation)

  • 김태성;채경철
    • 대한산업공학회지
    • /
    • 제22권1호
    • /
    • pp.95-104
    • /
    • 1996
  • We consider a two-phase queueing system with generalized vacation. Poisson arrivals receive a batch type service in the first phase and individual services in the second phase. The server takes generalized vacation when the system becomes empty. Generalized vacation includes single vacation, multiple vacation, and other types. We consider both gated batch service and exhaustive batch service. This is an extension of the model presented by Selvam and Sivasankaran [6].

  • PDF

휴리스틱 방법을 이용한 N정책과 준비기간을 갖는 휴가형 $Geo^x/G/1$ 모형의 평균대기시간 분석 (Heuristic Approach to the Mean Waiting Time of $Geo^x/G/1$ Vacation Queues with N-policy and Setup Time)

  • 이성희;김성진;채경철
    • 한국경영과학회지
    • /
    • 제32권1호
    • /
    • pp.53-60
    • /
    • 2007
  • We consider the discrete-time $Geo^x/G/1$ queues under N-policy with multiple vacations (a single vacation) and setup time. In this queueing system, the server takes multiple vacations (a single vacation) whenever the system becomes empty, and he begins to serve the customers after setup time only if the queue length is at least a predetermined threshold value N. Using the heuristic approach, we derive the mean waiting time for both vacation models. We demonstrate that the heuristic approach is also useful for the discrete-time queues.

일량제어정책과 단수휴가를 갖는 이산시간 대기행렬의 고객수 분석 (Queue Length Analysis of Discrete-time Queueing System under Workload Control and Single Vacation)

  • 이세원
    • 한국산업정보학회논문지
    • /
    • 제25권1호
    • /
    • pp.89-99
    • /
    • 2020
  • 본 논문에서는 유휴기간을 갖는 서버의 재가동이 단수휴가와 그동안 도착한 고객들의 총 일량에 의해 결정되는 이중제어정책을 다룬다. 고객들은 베르누이 도착과정으로 시스템에 한 명씩 도착하며, 자기 차례가 될 때까지 기다렸다가 선착순으로 서비스를 받는다. 서버는 시스템 내에 더 이상 서비스할 고객이 없으면 유휴기간을 가지며, 이와 동시에 이산확률변수 V의 휴가를 떠난다. 휴가 종료시점에서 대기 중인 고객들의 서비스 시간 총합이 일량 임계값 D를 초과하면 바로 서비스를 시작하고, 휴가 종료시점의 시스템 내 총 일량이 D 이하인 경우에는 일량 임계값을 넘길 때까지 기다렸다가 재가동한다. 이러한 혼합제어정책 하에서 운영되는 이산시간 Geo/G/1 대기행렬시스템을 대상으로 하여 유휴기간을 분석하고 안정상태 고객수 분포를 유도하였다.

단일 휴가형 Geo/Geo/1/K 대기행렬의 바쁜 기간 분석 (Busy Period Analysis of the Geo/Geo/1/K Queue with a Single Vacation)

  • 김길환
    • 산업경영시스템학회지
    • /
    • 제42권4호
    • /
    • pp.91-105
    • /
    • 2019
  • Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1 ≤ n ≤ K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

GENERAL FORMULAS OF SOME VACATION MODELS

  • Lim, Jong-Seul
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.389-393
    • /
    • 2008
  • This paper describes a single-server queue where the server is unavailable during some intervals of time, which is referred to as vacations. The major contribution of this work is to derive general formulas for the additional delay in the vacation models of the single vacations, head of line priority queues with non-preemptive service, and multiple vacations and idle time.

  • PDF

M/G/1 QUEUE WITH COMPLEX VACATION POLICIES

  • Lim, Jong-Seul;Oh, Choon-Suk
    • Journal of applied mathematics & informatics
    • /
    • 제6권3호
    • /
    • pp.943-952
    • /
    • 1999
  • Models of single-server queues with vacation have been widely used to study the performance of many computer communica-tion and production system. In this paper we use the formula for a wide class of vacation policies and multiple types of vacations based on the M/G/1 queue with generalized vacations and exhaustive service. furthermore we derive the waiting times for many complex vacation policies which would otherwise be to analyze. These new results are also applicable to other related queueing models. if they conform with the basic model considered in this paper.

준비기간을 포함한 다양한 휴가형태에서의 $M^{X}/G/1$ 시스템 분석 (An analysis of the $M^{X}/G/1$ system with various vacations and set-up time)

  • 허선;윤영호;안선응
    • 한국경영과학회지
    • /
    • 제27권2호
    • /
    • pp.111-121
    • /
    • 2002
  • In this paper, we analyze an M$^{x}$ /G/1 with three types of vacation periods including setup time. Three types of vacations are : N-policy, single vacation, and multiple vacation. We consider compound poisson arrival process and general service time, where the server starts his service when a setup is completed. We find the PGF of the number of customers in system and LST of waiting time, with welch we obtain their means. A decomposition property for the system sloe and waiting time is described also.