Mean value analysis of priority stations without preemption

A. Dekkers, J. Wal, van der

Research output: Book/ReportReportAcademic

35 Downloads (Pure)

Abstract

In this paper we will discuss an algorithm, based on the Mean Value Analysis, for the determination of the performance of a queueing network with non-preemptive priority-stations. Thus a client that has started service can always complete this service, even after arrival of clients with a higher priority. The algorithm mentioned above is implemented in PET (Performance Evaluation Tool), a software package of the Eindhoven University of Technology. Furthermore the algorithm is demonstrated in the light of a jobshop example.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages15
Publication statusPublished - 1990

Publication series

NameMemorandum COSOR
Volume9023
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'Mean value analysis of priority stations without preemption'. Together they form a unique fingerprint.

Cite this