Back to search

Iowa State University

Dynamic priority rules for cyclic queues with limited service regime

Abstract

dc:description.abstract

A cyclic service system with two stations operating under limited service regime has been analyzed, assuming poisson arrivals and exponential service at each service station. Zero switch-over times have been assumed. A thorough simulation study has been conducted, and guidelines have been obtained in the control of the behavior of such systems. It has been shown that the choice of service limits in symmetrical service systems has no effect on the average total waiting time in system, and that the performance measures for such systems can easily be obtained by converting the system into an M/M/1 system. This approach has been proven to be invalid for non-symmetric service systems. In the case of non-symmetric systems, setting the service limit at the station with longer average service duration at 1, and fixing it as high as possible for the station with the shorter average service duration has been shown to be the optimal strategy for minimizing the average delay in the system.

Degree

thesis:*
Name thesis:degree_name
Master of Science
Level thesis:degree_level
Masters
Discipline thesis:degree_discipline
Industrial Engineering
Year dc:date.issued
1993

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Yalçin, Onur

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Repository record dc:identifier.uri
https://dr.lib.iastate.edu/handle/20.500.12876/1wge6kKr
OAI identifier oai:identifier
oai:dr.lib.iastate.edu:20.500.12876/1wge6kKr

Chain of custody

source
Harvested from
Iowa State University
Base URL
dr.lib.iastate.edu/server/oai/request
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
related terms
citation

Yalçin, Onur. Dynamic priority rules for cyclic queues with limited service regime. Masters thesis, 1993. https://dr.lib.iastate.edu/handle/20.500.12876/1wge6kKr