Simulation of queueing systems with many stations and of queueing networks using copulas

Daniel Ciuiu

MPRA Paper from University Library of Munich, Germany

Abstract: In this paper we will generate queueing systems with c stations where the inter-arrival time and the c service times depend through a c+1 copula C. We will consider two models: first when the customer does not know the order of service times for the free service channels (he/she chooses the service channel randomly), and the second when he/she knows this order (he/she chooses the fastest free service channel). The marginals can be exponential, Erlang or hyper-exponential.

Keywords: Queueing systems; copula; simulation. (search for similar items in EconPapers)
JEL-codes: C02 C15 (search for similar items in EconPapers)
Date: 2010-04, Revised 2010-09
New Economics Papers: this item is included in nep-cmp and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Scientific Journal Mathematical Modeling in Civil Engineering 3.6(2010): pp. 72-86

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/27018/1/MPRA_paper_27018.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:27018

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().