BATCH ARRIVAL QUEUE WITH N-POLICY AND SINGLE VACATION

We consider an M(x)/G/1 queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length V. When the returns from the vacation, if the system size is greater than or equal to predetermined value N(threshold), he beings to serve the customers. If not, the server waits in the system until the system size reaches or exceeds N. We derive the system size distribution and show that the system size distribution decomposes into two random variables one of which is the system size of ordinary M(x)/G/1 queue. The interpretation of the other random variable will also be provided. We also derive the queue waiting time distribution of an arbitrary customer. Finally we develop a procedure to find the optimal stationary operating policy under a linear cost structure.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1995-02
Language
ENG
Keywords

SYSTEM

Citation

COMPUTERS OPERATIONS RESEARCH, v.22, no.2, pp.173 - 189

ISSN
0305-0548
URI
http://hdl.handle.net/10203/1345
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
C_OR-1.pdf(993.79 kB)Download
  • Hit : 968
  • Download : 994
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 74 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0