Skip to main content
SpringerLink
Log in

Analysis of a manufacturing queueing system using bi-level randomized policy

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

We propose a GI/M/1 queueing model with \((\xi _1,N_1,N_2)\)-policy. This means that the server shuts down immediately after serving all customers. The server is activated with probability \(\xi _1\) as soon as queue size reaches to \(N_1(\ge 1)\), or remain turned off with probability \(\xi _2~(=1-\xi _1)\). When there are \(N_2(>N_1)\) customers in the system, the server begins to provide the service to those customers who are waiting for the service and continues to do so until there are no more customers left in the system. To determine the probability distribution of the system content at various epochs, the steady-state analysis of the model is performed by utilizing two well-known methods, namely, the supplementary variable and the difference equation technique. Various performance measures are also provided along with the cost analysis of the model. In the end, we validate our analytical results by means of a few numerical instances, and we also carry out a few numerical experiments to investigate the influence that various factors have on the performance characteristics of the model. We show that for given waiting time, the presented model provides a less expected cost as compared to the traditional N-policy; further, a small increment in expected cost gives a far lower value of waiting time in the queue which is beneficial from customers’ point of view. With regards to the renewal arrival process in \((\xi _1,N_1,N_2)\)-policy queueing models, we have provided a significant methodological contribution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Akar N, Arikan E (1996) A numerically efficient method for the MAP/D/1/K queue via rational approximations. Queueing Syst 22(1–2):97–120

    Article  Google Scholar 

  • Aksoy HK, Gupta SM (2010) Near optimal buffer allocation in remanufacturing systems with N-policy. Comput Ind Eng 59(4):496–508

    Article  Google Scholar 

  • Barbhuiya FP, Gupta UC (2019) A difference equation approach for analysing a batch service queue with the batch renewal arrival process. J Differ Equ Appl 25(2):233–242

    Article  Google Scholar 

  • Barbhuiya FP, Gupta UC (2020) Analytical and computational aspects of the infinite buffer single server N policy queue with batch renewal input. Comput Oper Res 118:104916

    Article  Google Scholar 

  • Barbhuiya FP, Kumar N, Gupta UC (2022) Analysis of the GI/M/c queue with N-threshold policy. Qual Technol Quant Manag 19(4):490–510

    Article  Google Scholar 

  • Bell CE (1971) Characterization and computation of optimal policies for operating an M/G/1 queuing system with removable server. Oper Res 19(1):208–218

    Article  Google Scholar 

  • Chae K-C, Lee H (1995) \(MX/G/1\) vacation models with N-policy: heuristic interpretation of the mean waiting time. J Oper Res Soc 46(2):258–264

    Google Scholar 

  • Cox DR(1955) The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. In: Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 51, Cambridge University Press, pp. 433–441

  • Eladyi S(2000) An introduction to difference equations

  • Feinberg EA, Kim DJ (1996) Bicriterion optimization of an M/G/1 queue with a removable server. Probab Eng Inf Sci 10(1):57–73

    Article  Google Scholar 

  • Gautam A, Choudhury G, Dharmaraja S (2020) Performance analysis of DRX mechanism using batch arrival vacation queueing system with N-policy in LTE-A networks. Ann Telecommun 75:353–367

    Article  Google Scholar 

  • Gupta UC, Rao TSV (1994) A recursive method to compute the steady state probabilities of the machine interference model:(M/G/1)K. Comput Oper Res 21(6):597–605

    Article  Google Scholar 

  • Heyman DP (1968) Optimal operating policies for M/G/1 queuing systems. Oper Res 16(2):362–382

    Article  Google Scholar 

  • Jayachitra P, Albert A (2014) Recent developments in queueing models under N-policy: a short survey. Int J Math Arch 5(3):227–233

    Google Scholar 

  • Ke J-C, Wang K-H, Liou C-H(2006) A single vacation model G/M/1/K with N threshold policy, Sankhyā: Indian J Stat 198–226

  • Ke J-C (2003) The analysis of a general input queue with N policy and exponential vacations. Queueing Syst 45(2):135–160

    Article  Google Scholar 

  • Ke J-C (2003) The operating characteristic analysis on a general input queue with N policy and a startup time. Math Methods Oper Res 57:235–254

    Article  Google Scholar 

  • Ke J-C (2004) Bi-level control for batch arrival queues with an early startup and un-reliable server. Appl Math Model 28(5):469–485

    Article  Google Scholar 

  • Ke J-C, Wang K-H (2002) A recursive method for the N policy G/M/1 queueing system with finite capacity. Eur J Oper Res 142(3):577–594

    Article  Google Scholar 

  • Ke J-C, Huang H-I, Chu Y-K (2010) Batch arrival queue with n-policy and at most j vacations. Appl Math Model 34(2):451–466

    Article  Google Scholar 

  • Kimura T (1981) Optimal control of an M/G/1 queuing system with removable server via diffusion approximation. Eur J Oper Res 8(4):390–398

    Article  Google Scholar 

  • Komota Y, Nogami S, Hoshiko Y (1983) Analysis of the GI/G/1 queue by the supplementary variables approach. Electron Commun Jpn (Part I: Commun) 66(5):10–19

    Article  Google Scholar 

  • Krishnamoorthy A, Deepak T (2002) Modified N-policy for M/G/1 queues. Comput Oper Res 29(12):1611–1620

    Article  Google Scholar 

  • Kuang X, Tang Y, Yu M, Wu W (2022) Performance analysis of an M/G/1 queue with bi-level randomized \((p, N_1, N_2)\)-policy. RAIRO-Oper Res 56(1):395–414

    Article  Google Scholar 

  • Lee H, Park J (1997) Optimal strategy in N-policy production system with early set-up. J Oper Res Soc 48(3):306–313

    Article  Google Scholar 

  • Lee H-S, Srinivasan MM (1989) Control policies for the \(M^X/G/1\) queueing system. Manag Sci 35(6):708–721

    Article  Google Scholar 

  • Lee HW, Lee SS, Park JO, Chae K-C (1994) Analysis of the \(M^x/G/1\) queue by N-policy and multiple vacations. J Appl Probab 31(2):476–496

    Google Scholar 

  • Lee HW, Lee SS, Chae KC (1994) Operating characteristics of \(M^X/G/1\) queue with N-policy. Queueing Syst 15:387–399

    Article  Google Scholar 

  • Lee HW, Park NI, Jeon J (2003) Queue length analysis of batch arrival queues under bi-level threshold control with early set-up. Int J Syst Sci 34(3):195–204

    Article  Google Scholar 

  • Mahanta S, Kumar N, Choudhury G (2024) An analytical approach of Markov modulated Poisson input with feedback queue and repeated service under N-policy with setup time. Qual Technol Quant Manag 21(2):257–285

    Article  Google Scholar 

  • Medhi J, Templeton JG (1992) A Poisson input queue under N-policy and with a general start up time. Comput Oper Res 19(1):35–41

    Article  Google Scholar 

  • Singh G, Gupta UC, Chaudhry ML (2014) Analysis of queueing-time distributions for \(MAP/D_N/1\) queue. Int J Comput Math 91(9):1911–1930

    Article  Google Scholar 

  • Takagi H (1993) M/G/1/K queues with N-policy and setup times. Queueing Syst 14:79–98

    Article  Google Scholar 

  • Wang K-H, Huang K-B (2009) A maximum entropy approach for the (\(p, N\))-policy M/G/1 queue with a removable and unreliable server. Appl Math Model 33(4):2024–2034

    Article  Google Scholar 

  • Wang K-H, Ke J-C (2000) A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity. Appl Math Model 24(12):899–914

    Article  Google Scholar 

  • Wang J, Zhang X, Huang P (2017) Strategic behavior and social optimization in a constant retrial queue with the N-policy. Eur J Oper Res 256(3):841–849

    Article  Google Scholar 

  • Wolff RW (1982) Poisson arrivals see time averages. Oper Res 30(2):223–231

    Article  Google Scholar 

  • Yadin M, Naor P (1963) Queueing systems with a removable service station. J Oper Res Soc 14:393–405

    Article  Google Scholar 

  • Yang D-Y, Cho Y-C (2019) Analysis of the N-policy GI/M/1/K queueing systems with working breakdowns and repairs. Comput J 62(1):130–143

    Article  Google Scholar 

  • Yang D-Y, Ke J-C (2014) Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation. Appl Math Model 38(21–22):5113–5125

    Article  Google Scholar 

  • Yang D-Y, Wu C-H (2015) Cost-minimization analysis of a working vacation queue with N-policy and server breakdowns. Comput Ind Eng 82:151–158

    Article  Google Scholar 

  • Zhang ZG, Tian N (2004) The N threshold policy for the GI/M/1 queue. Oper Res Lett 32(1):77–84

    Article  Google Scholar 

  • Zhou M, Liu L, Chai X, Wang Z (2020) Equilibrium strategies in a constant retrial queue with setup time and the N-policy. Commun Stat-Theory Methods 49(7):1695–1711

    Article  Google Scholar 

Download references

Acknowledgements

The author would like to thank the editor and anonymous referees for their valuable remarks and suggestions which led to the paper in current form. The author would also like to thank professors Neeraj Misra and Dootika Vats, Department of Mathematics and Statistics, Indian Institute of Technology Kanpur India, for their time and suggestions.

Funding

No funding was received for conducting this study.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology, Jammu, 181221, India

    Nitin Kumar

Authors
  1. Nitin Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nitin Kumar.

Ethics declarations

Conflict of interest

The author has no conflict of interest to declare.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, N. Analysis of a manufacturing queueing system using bi-level randomized policy. TOP (2024). https://doi.org/10.1007/s11750-024-00675-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11750-024-00675-x

Keywords

Mathematics Subject Classification

Search

Navigation