An arriving decision problem in a discrete-time queueing system

  • Ivan AtenciaEmail author
  • José L. Galán-García
  • Gabriel Aguilera-Venegas
  • Pedro Rodríguez-Cielos
  • M. Ángeles Galán-García


This paper discusses a discrete-time queueing system in which an arriving customer may adopt four different strategies; two of them correspond to a LCFS discipline where displacements or expulsions occur, and in the other two, the arriving customer decides to follow a FCFS discipline or to become a negative customer eliminating the customer in the server, if any. The different choices of the involved parameters make this model to enjoy a great versatility, having several special cases of interest. We carry out a thorough analysis of the system, and using a generating function approach, we derive analytical results for the stationary distributions obtaining performance measures for the number of customers in the queue and in the system. Also, recursive formulae for calculating the steady-state distributions of the queue and system size has been developed. Making use of the busy period of an auxiliary system, the sojourn times of a customer in the queue and in the system have also been obtained. Finally, some numerical examples are given.


Discrete-time system Decision problem Trigger customers Negative customers 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



We would like to thank the anonymous referees for their helpful comments.


  1. 1.
    Artalejo, J.: G-networks: A versatile approach for work removal in queueing networks. Eur. J. Oper. Res. 126, 233–249 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Atencia, I.: A discrete-time system with service control and repairs. Int. J. Appl. Math. Comput. Sci. 24(3), 471–484 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Atencia, I.: A discrete-time system queueing system with server breakdowns and changes in the repair times. Annals of Operations Research. (2015)
  4. 4.
    Atencia, I., Fortes, I., Sánchez, S.: Discrete-time queueing system with expulsions. Communications in Computer and Information Science 356, 20–25 (2013)CrossRefzbMATHGoogle Scholar
  5. 5.
    Atencia, I., Moreno, P.: The discrete-time Geo/Geo/1 queue with negative customers and disasters. Comput. Oper. Res. 31(9), 1537–1548 (2004)CrossRefzbMATHGoogle Scholar
  6. 6.
    Atencia, I., Moreno, P.: A single-server G-queue in discrete-time with geometrical arrival and service process. Perform. Eval. 59, 85–97 (2005)CrossRefGoogle Scholar
  7. 7.
    Chao, X., Miyazawa, M., Pinedo, M.: Queueing Networks: Customers, Signals and Product Form Solutions. Wiley, New York (1999)zbMATHGoogle Scholar
  8. 8.
    Fiems, D., Steyaert, B., Bruneel, H.: Randomly interrupted G I/G/1 queues: service strategies and stability issues. Ann. Oper. Res. 112, 171–183 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gelenbe, E., Label, A.: G-networks with multiple classes of signals and positive customers. Eur. J. Oper. Res. 108, 293–305 (1998)CrossRefzbMATHGoogle Scholar
  10. 10.
    Harrison, P. G., Patel, N. M., Pitel, E.: Reliability modelling using G-queues. Eur. J. Oper. Res. 126, 273–287 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Krishnamoorthy, A., Gopakumar, B., Viswanath Narayanan, V.: A retrial queue with server interruptions, resumption and restart of service. Operations Research International Journal 12, 133–149 (2012)zbMATHGoogle Scholar
  12. 12.
    Krishnamoorthy, A., Pramod, P., Chakravarthy, S.: A note on characterizing service interruptions with phase-type distribution. Journal of Stochastic Analysis and Applications 31(4), 671–683 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Krishnamoorthy, A., Pramod, P., Chakravarthy, S.: A survey on queues with interruptions. TOP 22, 290–320 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Park, H. M., Yang, W. S., Chae, K. C.: The G e o/G/1 queue with negative customers and disasters. Stoch. Model. 25, 673–688 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Piórkowski, A., Werewka, J.: Minimization of the total completion time for asinchronous transmission in a packet data-transmission system. Int. J. Appl. Math. Comput. Sci. 20, 391–400 (2010)CrossRefzbMATHGoogle Scholar
  16. 16.
    Walraevens, J., Steyaert, B., Bruneel, H.: A preemptive repeat priority queue with resampling: performance analysis. Ann. Oper. Res. 146, 189–202 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    White, H., Christie, L.: Queuing with preemptive priorities or with breakdown. Oper. Res. 6(1), 79–95 (1958)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Higher Polytechnic School, Department of Applied MathematicsUniversity of MálagaMálagaSpain

Personalised recommendations