Asia Mathematika

An International Journal. ISSN: 2457-0834 (online)

Volume 1, Issue 2, December 2017, pp 5-14

M/M/C/K Queueing process and its designing selection of acceptance sampling plans


Department of mathematics, Jansons institute of technology, Coimbatore-641 659, Tamil Nadu, India.


A Queueing system comprises of batches or lots arriving for service, waiting for service, and then leaving the system after service. In Quality Control literature, the group of lots / batches arrives for testing, wait for testing, and then leave the system after acceptance or rejection of the entire batches or lots. Hence the arrival of incoming lots can be considered as Poisson input and the service time can be considered as exponential output. In this article a new designing algorithm is given for the selection of acceptance sampling plans from a M/M/C/K Queuing process. Lots come in a Queueing policy and waits for the service. Here service is meant only for testing the lot and making the decision about the lot. A novel algorithm is given for sentencing the number of lots in a production process. The sampling plans are developed based on the maximum number of arrivals (K) in the Queueing system. The parameters of the Queueing policy are derived and hence the parameters of the sampling plans are determined. Tables are constructed to select the appropriate sampling plans.


Expected number of arrivals, M/M/C/K Production process, Sampling Plans, Traffic intensity.



1. Donald Gross, John F Shortle, James M. Thompson and Carl M. Harris(2008), “Fundamentals of Queueing Theory”, John Wiley & sons, IV edition, New Delhi.

2. Devaarul, S and Santhi, T (2014), “A Study on Group Sampling plans indexed through Inflection point”, National Conference on Recent advances in Statistical models and methods, Department of Statistics, Government Arts College, Coimbatore, India.

3. Dieter Fiems and Herwig Bruneel, “Analysis of a Discrete-Time Queueing System with Timed Vacations” , Queueing Systems 42 :243–254.

4. Huei-Wen Ferng and Jin-Fu Chang (2000), “The departure process of discrete-time queueing systems with Markovian type inputs” ,Queueing Systems 36 :201–220.

5. Hideaki Takagi and Kin K. Leung(1994), “Analysis of a discrete-time queueing system with time-limited service” , Queueing Systems 18: 183-197.

6. Igor N. Kovalenko(1994), “Rare events in Queueing systems - A survey” Queueing Systems 16:1-49.

7. Kiyoshi Mutoa, Haruo Miyazakia, Yoichi Sekia, Yoshihiro Kimurab and Yukio Shibataa(1995), “Lattice path counting and M/M/C Queueing systems”, Queueing Systems 19:193-214.

8. Martin J. Beckmann (1994), “Making the customers wait:the optimal number of servers in a queueing system”, OR Spektrum 16:77-79.

9. Murali, S and Ramaswami, K.S. (2014), “A Numerical frame work for Solving D/G(A,N/A,Q)/ 1/Qmax of Discrete time Queues”, International Journal of Applied Engineering Research,Volume 9, Number 22: 11961-11968.

10. Ramaswami K.S.(2005), “Bulk Queuing Models with Controllable Services, State Dependent Arrivals and multiple vacations”, Ph.D. Thesis, Department of Mathematics and Computer Applications, P.S.G. College of Technology, Coimbatore – 641 004, India.

11. Schilling (1967). “A general method for determining the OC of Mixed variable-attributes Sampling plans, Single sided specifications, SD known”, Ph.D. Thesis, Rutgers – The state university, New Brunswick, New Jersey.

mail to for access the full article

Visitors count

Join us