Back to search

NJIT

A modified M/G/1/N system and its application

Abstract

dc:description.abstract

<p>We study a single server queueing system with finite buffer, Poisson arrivals and exceptional service requirements for the first customer in each busy period. The system is studied as a Markov Chain and the limiting probability distributions are obtained. The explicit form sorution for the queue length distribution, blocking probability, waiting time distribution as well as the busy period are derived through the Laplace-Stieltjes transform method. These results are then applied to a tandem system with a finite buffer in front of the first station and no intermediate buffer between the two stations. Finally, similar results are obtained for the queueing system with batch poisson arrival processes.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Industrial Engineering - (M.S.)
Discipline thesis:degree_discipline
Mechanical and Industrial Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Figueroa, Bernice Annette
Contributors dc:contributor
  • Xiuli Chao
  • Layek Abdel-Malek
  • Golgen Bengu

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2481

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Figueroa, Bernice Annette. A modified M/G/1/N system and its application. https://digitalcommons.njit.edu/theses/2481