Performance Analysis of a Queueing System with Facilities Requiring Post-Processing

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 182
  • Download : 0
This paper considers a queuing system in which a fixed number of identical facilities (servers) are employed one at a time for providing individual customer service at the single service station with unit capacity and each facility undergoes a post-processing after serving its own customer. Customers arrive in a Poisson process, and the customer service time and the facility post-processing time distributions are all exponential. For the queuing system, two different cases, the loss system (finite buffer capacity) and the delay system (infinite buffer capacity), will be analyzed separately to exploit their approximate computation algorithms for the associated long-run system state distributions. The algorithms are then tested for efficiency and effectiveness with various numerical problems.
Publisher
Pergamon-Elsevier Science Ltd
Issue Date
1992-01
Language
English
Article Type
Article
Keywords

APPROXIMATE ANALYSIS; OPEN NETWORKS; BLOCKING; QUEUES; CONFIGURATIONS

Citation

COMPUTERS & OPERATIONS RESEARCH, v.19, no.8, pp.767 - 781

ISSN
0305-0548
URI
http://hdl.handle.net/10203/59150
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0