Using the discrete time modelling approach to evaluate the time-dependent behaviour of queueing systems

Journal of the Operational Research Society

Volumn 50, Issue 8, 1999, Pages 777-788

  Worthington, Dave ^a   Wall, A ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b LIVERPOOL JOHN MOORES UNIVERSITY   (United Kingdom)

Author keywords

Computational analysis; Discrete time; Inhomogeneous; Markov processes; Queueing

Indexed keywords

COMPUTATIONAL METHODS; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS;

DISCRETE TIME MODELING (DTM) METHOD; MATRIX-GEOMETRIC METHODS;

QUEUEING THEORY;

EID: 0032658237     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600783     Document Type: Article

References (57)

1. Eick SG, Massey WA and Whitt W (1993). M/G/∞ queues with sinusoidal arrival rates. Mgmt Sei 39: 241-252.
2. Green L, Kolesar P and Svoronos S (1991). Some effects of nonstationarity on multi-server Markovian queueing systems. Opns Res 39: 502-511.
3. Gross D and Harris CM (1985). Fundamentals of Queueing Theory, 2nd ed. John Wiley & Sons: New York.
4. Zhang J (1991). Transient solutions of time-dependent M/M/1 queues. IEEE Trans, on Inform Theory 37: 1690-1696.
5. Sharma OP (1990). Markovian Queues, Ellis Horwood: Chichester.
6. Bunday BD (1996). An Introduetion to Queueing Theory. Arnold: London.
7. Choudhury G, Lucantoni D and Whitt W (1993). Multi-dimensional transform inversion with applications to the transient M/G/1 queue. Report from AT&T Bell Laboratories, USA.
8. Dormuth DW and Alfa AS (1994). Using the randomization method to evaluate the non-equilibrium behaviour of PH(t)/PH(t)/1/K queues. Personal communication.
9. Grassmann WK (1977). Transient solutions in Markovian queueing systems. Comp Oper Res 4: 47-53.
10. Alfa AS (1990). Approximating queue lengths in M(t)/D/1 queues. Eur J Op Res 44: 60-66.
11. Alfa AS and Chen M (1991). Approximating queue lengths in M(t)/G/1 queues using the maximum entropy principle. Aeta Informatiea 28: 801-815.
12. Clarke GM (1981). Use of Polya distributions in approximate solutions to nonstationary M/M/s queues. Commun ACM 24: 206-217.
13. Taafe MR and Ong KL (1987). Approximating nonstationary Ph(t)/M(t)/s/c queueing systems. Ann Oper Res 9: 103-116.
14. Ong KL and Taafe MR (1988). Approximating nonstationary Ph(t)/Ph(t)/I/c queueing systems. Math and Computers in Simulation 30: 441-452.
15. Green L and Kolesar P (1991). The pointwise stationary approximation for queues with nonstationary arrivals. Mgmt Sci 37: 84-97.
16. Gross D and Miller D (1984). The randomization technique as a modeling tool and solution procedure for transient Markov processes. Opns Res 32: 343-361.
17. Meisling T (1958). Discrete-time queueing theory. Opns Res 6: 96-105.
18. Miyazawa M and Takagi H (1994). Advances in discrete time queues, (editorial introduction). Queueing Sys 18: 1-3.
19. Bruneel H and Kim BG (1993). Discrete-time Models for Communication Systems Including ATM. Kluwer Academic: Boston.
20. Takagi H (1993). Queueing Analysis: A Foundation of Performance Evaluation, Vol 3: Discrete-Time Systems. Elsevier: Amsterdam.
21. Woodward ME (1994). Communication and Computer Networks. Modelling with Discrete-Time Queues. IEEE Computer Society Press: Los Alamitos, California.
22. Neuts MF (1981) Matrix Geometric Solutions in Stochastic Models—an Algorithmic Approach. John Hopkins University Press: Baltimore.
23. Neuts MF (1989). Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker Inc: New York.
24. Alfa AS and Neuts MF (1995). Modelling vehicular traffic using the discrete time Markovian arrival process. Transport Sci 29: 109-117.
25. Alfa AS and Chakravarthy SA (1994). A discrete queue with the Markovian arrival process and phase type primary and secondary services. Commun. Statist.-StochasticModels, 10: 437-451.
26. Alfa AS, Chakravarthy S and Dolhun KL (1995). A discrete single server queue with Markovian arrival process and phase type group services. JAppl Mathematics and Stochastic Anal 8: 151-176.
27. Alfa AS (1998). Matrix geometric solution of discrete time MAP/PH/1 priority queue. Naval Res Logist 45: 23-50.
28. Neuts MF (1975). Computational uses of the method of phases in the theory of queues. Comp and Maths with Appls 1: 151-166.
29. Neuts MF (1979). A versatile Markovian point process. J Appl Prob 16: 764-779.
30. Lucantoni DM (1991). New results on the single server queue with a batch Markovian arrival process. Stoch Mod 7: 1-46.
31. Alfa AS (1995). A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service. Opns Res Lett 18: 31-40.
32. Omosigho SE and Worthington DJ (1985). The single server queue with inhomogeneous arrival rate and discrete service time distribution. Eur J Opl Res 22: 397-407.
33. Dafermos S and Neuts MF (1971). A single server in discrete time. Cahiers du Centre de Recherche Operationnelle 13: 2340.
34. Neuts MF (1973). The single server queue in discrete time— numerical analysis 1. Naval Res Logist Q 20: 297-304.
35. Omosigho SE and Worthington DJ (1988). An approximation of known accuracy for single server queues with inhomogeneous arrival rate and continuous service time distribution. Eur J Opl Res 33: 304-313.
36. Brahimi M and Worthington DJ (1991). The finite capacity multi-server queue with inhomogeneous arrival rate and discrete service time distribution and its application to continuous service time problem. Eur J Opl Res 50: 310-324.
37. k/r. Mgmt Sci 14: 692-712.
38. Wall AD (1995). Extending the scope of discrete time models to provide practical results for continuous time queueing systems. PhD Thesis, University of Lancaster, Lancaster, UK.
39. Tijms HC (1986). Stochastic Modelling and Analysis, A Computer Approach, Wiley series in probability and mathematical statistics: Chichester.
40. El-Affendi MA and Kouvatsos DD (1983). A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems with equilibrium. Acta Informatica 19: 339-355.
41. Allen AO (1978). Probability, Statistics and Queueing Theory with Computer Science Application, Academic Press: New York.
42. Wall AD and Worthington DJ (1994). Using discrete distributions to approximate general service time distributions in queueing models. J Opl Res Soc 45: 1398-1404.
43. Brahimi M (1990). Approximating multi-server queues with inhomogeneous arrival rates and continuous service time distributions. PhD Thesis, University of Lancaster, Lancaster, UK.
44. 0.C/. Eur J Opl Res 28: 158-174.
45. Alfa AS (1982). Time-inhomogeneous bulk server queue in discrete time: A transportation type problem. Eur J Opl Res 30: 650-658.
46. Mejia-Tellez J (1993). Models for single-server bulk-service queueing system of transportation type. PhD Thesis, University of Lancaster, Lancaster, UK.
47. Mniachi ARC (1997). Discrete time models for the time dependent behaviour of queues in series. PhD Thesis, University of Lancaster, Lancaster, UK.
48. Worthington DJ (1987). Queueing models for hospital waiting lists. J Opl Res Soc 38: 413-422.
49. Segal M (1974). The operator scheduling problem: a network flow approach. Opns Res 22: 808-823.
50. Mok SK and Shanthikumar JG (1987). A transient queueing model for business office with standby servers. Eur J Opl Res 28: 158-174.
51. Agnihothri SA and Taylor PA (1991). Staffing a centralised appointment scheduling department in Lourdes hospital. Interfaces 21: 1-11.
52. Jaiswal NK (1968). Priority Queues, Academic Press: New York.
53. Doshi BT (1986). Queueing systems with vacations— a survey. Queue Sys 1: 29-66.
54. Doshi BT (1990). Single server queues with vacations, In: Takasi H (ed). Stochastic Analysis of Computer and Communication Systems, Elsevier Science (North Holland): Amsterdam.
55. Alfa AS and Frigui I (1996). Discrete NT-policy single server queue with Markovian arrival process and phase type service. Eur J Opl Res 88: 599-613.
56. Papadopoulos HT, Heavey C and Browne J (1993). Queueing Theory in Manufacturing Systems Analysis and Design. Chapman & Hall: London.
57. De Souza E, Silva E and Muntz RR (1990). Queueing networks: solutions and applications, In: Takagi H (ed). Stochastic Analysis of Computer and Communication Systems. Elsevier: New York, 319-399.