Start-up class models in multiple-class queues with N-policy

Authors:
H. W. Lee;S. H. Yoon;W. J. Seo
Affiliations:
School of Systems Management Engineering, Sung Kyun Kwan University, Su Won, 440-746 Korea E-mail: hwlee@yurim.skku.ac.kr.;ETRI, Tae Jon, Korea;School of Systems Management Engineering, Sung Kyun Kwan University, Su Won, 440-746 Korea E-mail: hwlee@yurim.skku.ac.kr.
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 4
Cited 1

Control policies for the MX/g/1 queueing system

Management Science
Time-dependent analysis of M/G/1 vacation models with exhaustive service

Queueing Systems: Theory and Applications
Priority queues with setup times

Operations Research
Batch arrival queue with N-policy and single vacation

Computers and Operations Research

An analysis of multiple-class vacation queues with individual thresholds

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider multiple-class queueing systems with N-policy in which the idle server starts service as soon as the number of customers in the “start-up class” reaches threshold N. We consider the cases of FCFS and nonpreemptive priority. We obtain the Laplace–Stieltjes transform of the waiting times of each class of customers. We also show some results for the general behavior of such systems.