Transient Solution of a Multi-Server Queue. with Catastrophes and Impatient Customers. when System is Down
|
|
- Madlyn Little
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Sciences, Vol. 8, 2014, no. 92, HIKARI Ltd, Transient Solution of a Multi-Server Queue with Catastrophes and Impatient Customers when System is Down G. Arul Freeda Vinodhini Saveetha School of Engineering Saveetha University, Chennai-32, India V. Vidhya Saveetha School of Engineering Saveetha University, Chennai-32, India Copyright 2014 G. Arul Freeda Vinodhini and V. Vidhya. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We consider an M/M/c queuing system, which occasionally suffers disastrous failure and all the customers are lost. The repair mechanism starts immediately. When the system is down, the stream of arrivals continue. However the new arrivals become impatient and activate their own timer. If the system is still down when the timer expires, the customer abandons the system never to return. We obtain the exact transient solution for the system by a direct approach. Mathematics Subject Classification: Primary 60K25, Secondary 68M20 Keywords: M/M/c Disaster Impatience - Transient Probabilities Generating function
2 4586 G. Arul Freeda Vinodhini and V. Vidhya 1 Introduction In real life, many queuing situations arise which are not reliable and disasters may occur leading to loss of several or all customers. Such situations are common in computer network applications, telecommunication applications that depend on satellites and inventory system that store perishable goods. Customer impatience is also observed in queue models like impatient telephone switch board customers, packet transmission etc Also many traditional studies analyze queuing system in steady state, requiring appropriate warm up period. However, in many cases the system being modeled never reaches steady state and hence do not accurately portray the system behavior, as in military air traffic control, emergency medical service etc The earlier works on the transient behavior of queues in literature were published in the late 1950 s and in early 1960 s. The transient solution of various single server queue models like state dependent queues [4], potential customers discouraged by queue length[3], feedback with catastrophes [8] etc are studied in the literature. In 2010, R. Sudhesh derived transient solution of a single server queue with system disaster and customer impatience [7]. In 1989, P.R. Parthasarathy and M. Sharfli gave the transient solution to many server Poisson queue [2].R.O. Al Seedy et al derived the transient solution of M/M/c queue with balking and reneging [1]. Transient solution of a multi-server Poisson queue with N policy was derived by P.R. Parthasarathy and R. Sudhesh [5]. In the present paper, multi-server queue is considered in the presence of system disaster and customer impatience when the system is down. A closed solution for transient probabilities of the model is derived. This work expands the previous work by Yechiali [9] where the steady state probabilities of the model are derived. It also uses the results obtained by Sudhesh [7].The rest of the paper is organized as follows. Section 2 explains the governing equations of the model. In Section 3 the transient probabilities of the model are derived. Section 4 presents the validity of the transient probabilities obtained. Section 5 is the conclusion and finally the references are given. 2 Model Description 2.1 The model and transition diagram Customers arrive at an M/M/c type queue according to a Poisson process with rate. Service times are exponentially distributed with mean 1. The system suffers disastrous breakdowns, occurring when the server is at functioning phase, at a Poisson rate. When the system fails all servers stop working and all customers present are rejected and lost. Upon failure, a repair process starts imme-
3 Transient solution of a multi-server queue 4587 diately with exponentially distributed with mean 1. Impatient customers activate a timer exponentially distributed with mean 1, such that if the repair process has not been completed by the time expires, the customers abandons the system never return. The above process generates a two dimensional continuous time Markov process as follows. Let J indicate the system s phase: J=1 denote that the system is functioning and serving customers, while J=0 indicates the system is down, undergoing a repair process. The system alternates between the two phases and it turns out that the proposition of time the system stays in the two phases are not affected by the number of servers of the system. If L denotes the number of customers in the system, then (J, L) define a two dimensional continuous Markov chain with state space, : 0, 1; 0, 1, Governing equations Let denote the system state probabilities in transient state. From the transition diagram the Kolmogorov differential difference equations are given by, (2.1), 1,, 1 (2.2) (2.3), 1,, 1 1 (2.4),,, (2.5) Also, assume that the system is working and there are no customers in the system at time 0. (i.e.) 0 1 and Clearly, for any 0, 1. 3 Transient Solution 3.1 Expressions for The equations for the phase J=0 (2.1 and 2.2) are same as solved by R. Sudhesh [10]. 3.2 Expressions for Evaluation of for n = c, c+1, c+2 If we define,,, with,, and, 0 1,then equations 2.3, 2.4 and 2.5 reduce to the differential equation.,, 1,,,,
4 4588 G. Arul Freeda Vinodhini and V. Vidhya Solving the above equation, we get, 1,, Taking 2 and 1,,, (2.6) we have Equating coefficients of on both sides we get,,,, +,,,,,,, (2.7) Put n = 0 on both sides we get,,,, +,,,,,, (2.8) Put in (2.7) and using.. 0,, +,,,,
5 Transient solution of a multi-server queue 4589,, (2.9) From (2.7) and (2.9) for n =1, 2, 3 we get,, =,,,,, (2.10) 3.2.2: Evaluation of for n = 0, 1, 2 (c-1) Consider the system of equations 2.1 and 2.2 along with the condition 2.8. Equations 2.1 and 2.2 can be expressed in the form 1, (2.11) where,,,,,,,, and , 0, 1, 2, 2, 0, 1, 2, 2 1 1, 0, 1, 2, 3 Taking Laplace transform of 2.11, 1, 0 (2.12) Also,,, (2.13) Thus only,has to be found. Combining equations 2.8, 2.12 and 2.13 we get,, (2.14), where,. (2.15) To find: For smaller order matrices can be found by the usual procedure. For higher order matrices, we follow the procedure given by Raju and Bhat in [6]. Let where
6 4590 G. Arul Freeda Vinodhini and V. Vidhya,,,,, 0,1,2 3 (2.16), 2, For 0, 1, 2 2 where, are recursively given as, 1 0,1,2 2 ;, 0,1,2 3,,,,, 0,1,2 3 2,, 0,1, and, 0 for other values of k and j. Using above result in (2.14),,,,,, (2.17) and from (2.12) for 0, 1, 2 2, 1,,,,, (2.18) We observe that, are all rational algebraic functions in s. The cofactor of the (k, j)th element of is a polynomial of degree 2. In particular, the cofactors of the diagonal elements are polynomials in s of degree 2 with the leading coefficient equal to 1.In fact, 0 is the characteristic equation of A. Since, 0 the characteristic roots of A are all distinct and negative [10]. Hence the inverse transform, of, can be obtained by partial fraction decomposition. Let, 0, 1, 2 2 be the characteristic roots of the matrix. Then,, where, lim.s,,. (2.19) Defining 1 1 0,1,2 2 (2.20) Where can be resolved as, with lim 1 Thus the inverse transform of is given by, j 0, 1 2. Using (2.20) in (2.17),
7 Transient solution of a multi-server queue 4591,, which simplifies to, 1 1, On inversion we get,, 1, (2.21) where can be obtained by inverting (2.15) as,, 2, Inverting (2.18), for k = 0, 1,2 c-2 we get, 1,,,,, (2.22) Thus the transient state probabilities for the state J=1 are given by the equations (2.10), (2.21) and (2.22). 4 Deductions (i) When c=1(assuming m=0 for initially there are zero customers), the problem reduces to the model derived in [7]. (ii) When and tends to 0(assuming 0for initially there are zero customers), the model becomes an ordinary transient multi server model and hence the transient probabilities coincide with [2]. 5 Conclusion Transient solution for multi server queue with impatience and disaster is derived. Such situations may occur when a computerized information center suddenly becomes inoperative, in some real life public service systems when potential customers leave the system one by one when the system is down. For handling such problems transient solutions portray the system better than a steady state solution.
8 4592 G. Arul Freeda Vinodhini and V. Vidhya References [1] Al-Seedy R.O., A.A. El. Sherbiny, S.A.ElShehawy, S.I. Ammar, Transient solution of M/M/c queue with balking and reneging, Computers and Mathematics with Applications 57(2009), [2] Parthasarathy P.R, M. Sharafali, Transient solution to the many server Poisson queue: A simple approach, Journal of applied probability 26(1989), [3] Parthasarathy P.R., Selvaraju. N, Transient analysis of a queue where potential customers are discouraged by queue length, Math. Probl. Eng.7(2001), [4] Parthasarathy P.R., Sudhesh.R, Exact transient solution of state dependent birth death processes. J.appl.Math.Stch. Anal.2006,(2006) Article ID 97073, [5] Parthasarathy P.R., Sudhesh.R, Transient solution of a multi-server Poisson queue with N Policy, Computers and Mathematics with Applications 55(2008), [6] Raju S. N., U.N. Bhat, A computationally oriented analysis of the G/M/1 queue, Opsearch 19(1982), [7] Sudhesh. R, Transient analysis of a queue with system disasters and customer impatience, Queueing Syst 66(2010), [8] Thangaraj. V. Vanitha. S, On the analysis of M/M/1 feedback queue with catastrophes using continued fractions, International journal of Pure and Applied Mathematics 53(2009), [9] Uri Yechiali, Queues with system disasters and impatient customers when the system is down, Queueing Syst 56(2007), [10] W. Lederman, G.E.H Reuter, Spectral theory for the differential equations of simple birth and death processes, Philosophical Transactions of the Royal society London 246(1954), Received: June 5, 2014
Multiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationSTEADY-STATE BEHAVIOR OF AN M/M/1 QUEUE IN RANDOM ENVIRONMENT SUBJECT TO SYSTEM FAILURES AND REPAIRS. S. Sophia 1, B. Praba 2
International Journal of Pure and Applied Mathematics Volume 101 No. 2 2015, 267-279 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i2.11
More informationBatch Arrival Queueing System. with Two Stages of Service
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 6, 247-258 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.411 Batch Arrival Queueing System with Two Stages of Service S. Maragathasundari
More informationA Heterogeneous two-server queueing system with reneging and no waiting line
ProbStat Forum, Volume 11, April 2018, Pages 67 76 ISSN 0974-3235 ProbStat Forum is an e-journal. For details please visit www.probstat.org.in A Heterogeneous two-server queueing system with reneging and
More informationNetworks of Queues Models with Several. Classes of Customers and Exponential. Service Times
Applied Mathematical Sciences, Vol. 9, 2015, no. 76, 3789-3796 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.53287 Networks of Queues Models with Several Classes of Customers and Exponential
More informationTransient Analysis of Queueing Model
TUTA/IOE/PCU Journal of the Institute of Engineering, 2015, 11(1): 165-171 TUTA/IOE/PCU Printed in Nepal 165 Transient Analysis of Queueing Model Shyam Sundar Sah *, Ram Prasad Ghimire Department of Mathematical
More informationInternational Journal of Pure and Applied Mathematics Volume 28 No ,
International Journal of Pure and Applied Mathematics Volume 28 No. 1 2006, 101-115 OPTIMAL PERFORMANCE ANALYSIS OF AN M/M/1/N QUEUE SYSTEM WITH BALKING, RENEGING AND SERVER VACATION Dequan Yue 1, Yan
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationAnalysis of Blood Transfused in a City Hospital. with the Principle of Markov-Dependence
Applied Mathematical Sciences, Vol. 8, 2, no., 86-862 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.288/ams.2.8 Analysis of Blood Transfused in a City Hospital with the Principle of Markov-Dependence
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationAN M/M/1 QUEUE IN RANDOM ENVIRONMENT WITH DISASTERS
Asia-Pacific Journal of Operational Research Vol. 3, No. 3 (204) 45006 (2 pages) c World Scientific Publishing Co. & Operational Research Society of Singapore DOI: 0.42/S027595945006X AN M/M/ QUEUE IN
More informationNon-Persistent Retrial Queueing System with Two Types of Heterogeneous Service
Global Journal of Theoretical and Applied Mathematics Sciences. ISSN 2248-9916 Volume 1, Number 2 (211), pp. 157-164 Research India Publications http://www.ripublication.com Non-Persistent Retrial Queueing
More informationAnalysis of a Two-Phase Queueing System with Impatient Customers and Multiple Vacations
The Tenth International Symposium on Operations Research and Its Applications (ISORA 211) Dunhuang, China, August 28 31, 211 Copyright 211 ORSC & APORC, pp. 292 298 Analysis of a Two-Phase Queueing System
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationReview Paper Machine Repair Problem with Spares and N-Policy Vacation
Research Journal of Recent Sciences ISSN 2277-2502 Res.J.Recent Sci. Review Paper Machine Repair Problem with Spares and N-Policy Vacation Abstract Sharma D.C. School of Mathematics Statistics and Computational
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationAnalysis of a Machine Repair System with Warm Spares and N-Policy Vacations
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) ijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 190 198 Analysis of a Machine Repair System
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationSystem with a Server Subject to Breakdowns
Applied Mathematical Sciences Vol. 7 213 no. 11 539 55 On Two Modifications of E 2 /E 2 /1/m Queueing System with a Server Subject to Breakdowns Michal Dorda VSB - Technical University of Ostrava Faculty
More informationAn M/M/1/N Queuing system with Encouraged Arrivals
Global Journal of Pure and Applied Mathematics. ISS 0973-1768 Volume 13, umber 7 (2017), pp. 3443-3453 Research India Publications http://www.ripublication.com An M/M/1/ Queuing system with Encouraged
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationA Heterogeneous Two-Server Queueing System with Balking and Server Breakdowns
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 230 244 A Heterogeneous Two-Server Queueing
More informationM.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS)
No. of Printed Pages : 6 MMT-008 M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS) Term-End Examination 0064 December, 202 MMT-008 : PROBABILITY AND STATISTICS Time : 3 hours Maximum
More informationChapter 3 Balance equations, birth-death processes, continuous Markov Chains
Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationA Queueing Model for Sleep as a Vacation
Applied Mathematical Sciences, Vol. 2, 208, no. 25, 239-249 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ams.208.8823 A Queueing Model for Sleep as a Vacation Nian Liu School of Mathematics and
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationAnalysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations Yan Zhang 1 Dequan Yue 1 Wuyi Yue 2 1 College of Science, Yanshan University, Qinhuangdao 066004 PRChina 2 Department of Information
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
More informationPerformance Analysis of an M/M/c/N Queueing System with Balking, Reneging and Synchronous Vacations of Partial Servers
The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp. 128 143 Performance Analysis of an M/M/c/ Queueing
More informationStability Condition of a Retrial Queueing System with Abandoned and Feedback Customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 December 2015), pp. 667 677 Applications and Applied Mathematics: An International Journal AAM) Stability Condition
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationStationary Flows in Acyclic Queuing Networks
Applied Mathematical Sciences, Vol. 11, 2017, no. 1, 23-30 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.610257 Stationary Flows in Acyclic Queuing Networks G.Sh. Tsitsiashvili Institute
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationOn Symmetric Bi-Multipliers of Lattice Implication Algebras
International Mathematical Forum, Vol. 13, 2018, no. 7, 343-350 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2018.8423 On Symmetric Bi-Multipliers of Lattice Implication Algebras Kyung Ho
More informationSymmetric Properties for the (h, q)-tangent Polynomials
Adv. Studies Theor. Phys., Vol. 8, 04, no. 6, 59-65 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/astp.04.43 Symmetric Properties for the h, q-tangent Polynomials C. S. Ryoo Department of Mathematics
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationAvailability and Reliability Analysis for Dependent System with Load-Sharing and Degradation Facility
International Journal of Systems Science and Applied Mathematics 2018; 3(1): 10-15 http://www.sciencepublishinggroup.com/j/ijssam doi: 10.11648/j.ijssam.20180301.12 ISSN: 2575-5838 (Print); ISSN: 2575-5803
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More information2. Transience and Recurrence
Virtual Laboratories > 15. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 2. Transience and Recurrence The study of Markov chains, particularly the limiting behavior, depends critically on the random times
More informationSTOCHASTIC MODELS FOR RELIABILITY, AVAILABILITY, AND MAINTAINABILITY
STOCHASTIC MODELS FOR RELIABILITY, AVAILABILITY, AND MAINTAINABILITY Ph.D. Assistant Professor Industrial and Systems Engineering Auburn University RAM IX Summit November 2 nd 2016 Outline Introduction
More informationInventory Ordering Control for a Retrial Service Facility System Semi- MDP
International Journal of Engineering Science Invention (IJESI) ISS (Online): 239 6734, ISS (Print): 239 6726 Volume 7 Issue 6 Ver I June 208 PP 4-20 Inventory Ordering Control for a Retrial Service Facility
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationNumerical Investigation of the Time Invariant Optimal Control of Singular Systems Using Adomian Decomposition Method
Applied Mathematical Sciences, Vol. 8, 24, no. 2, 6-68 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ams.24.4863 Numerical Investigation of the Time Invariant Optimal Control of Singular Systems
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More informationGeom/G 1,G 2 /1/1 REPAIRABLE ERLANG LOSS SYSTEM WITH CATASTROPHE AND SECOND OPTIONAL SERVICE
J Syst Sci Complex (2011) 24: 554 564 Geom/G 1,G 2 /1/1 REPAIRABLE ERLANG LOSS SYSTEM WITH CATASTROPHE AND SECOND OPTIONAL SERVICE Yinghui TANG Miaomiao YU Cailiang LI DOI: 10.1007/s11424-011-8339-2 Received:
More informationOn Some Identities and Generating Functions
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 38, 1877-1884 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.35131 On Some Identities and Generating Functions for k- Pell Numbers Paula
More informationM/M/1 Retrial Queueing System with Negative. Arrival under Erlang-K Service by Matrix. Geometric Method
Applied Mathematical Sciences, Vol. 4, 21, no. 48, 2355-2367 M/M/1 Retrial Queueing System with Negative Arrival under Erlang-K Service by Matrix Geometric Method G. Ayyappan Pondicherry Engineering College,
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
More informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South
More informationMorphisms Between the Groups of Semi Magic Squares and Real Numbers
International Journal of Algebra, Vol. 8, 2014, no. 19, 903-907 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2014.212137 Morphisms Between the Groups of Semi Magic Squares and Real Numbers
More informationDiophantine Equations. Elementary Methods
International Mathematical Forum, Vol. 12, 2017, no. 9, 429-438 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7223 Diophantine Equations. Elementary Methods Rafael Jakimczuk División Matemática,
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationThe Expected Opportunity Cost and Selecting the Optimal Subset
Applied Mathematical Sciences, Vol. 9, 2015, no. 131, 6507-6519 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.58561 The Expected Opportunity Cost and Selecting the Optimal Subset Mohammad
More informationAn Introduction to Stochastic Modeling
F An Introduction to Stochastic Modeling Fourth Edition Mark A. Pinsky Department of Mathematics Northwestern University Evanston, Illinois Samuel Karlin Department of Mathematics Stanford University Stanford,
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationOn Positive Stable Realization for Continuous Linear Singular Systems
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 8, 395-400 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4246 On Positive Stable Realization for Continuous Linear Singular Systems
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
More informationHyperbolic Functions and. the Heat Balance Integral Method
Nonl. Analysis and Differential Equations, Vol. 1, 2013, no. 1, 23-27 HIKARI Ltd, www.m-hikari.com Hyperbolic Functions and the Heat Balance Integral Method G. Nhawu and G. Tapedzesa Department of Mathematics,
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationEstimation of the Bivariate Generalized. Lomax Distribution Parameters. Based on Censored Samples
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 6, 257-267 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.4329 Estimation of the Bivariate Generalized Lomax Distribution Parameters
More informationAnalysis of an M/G/1 queue with customer impatience and an adaptive arrival process
Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process O.J. Boxma 1, O. Kella 2, D. Perry 3, and B.J. Prabhu 1,4 1 EURANDOM and Department of Mathematics & Computer Science,
More informationM [X] /G/1 with Second Optional Service, Multiple Vacation, Breakdown and Repair
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 3-9364, ISSN (Print): 3-9356 Volume Issue ǁ November. 4 ǁ PP.7-77 M [X] /G/ with Second Optional Service, Multiple Vacation,
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationof a Two-Operator Product 1
Applied Mathematical Sciences, Vol. 7, 2013, no. 130, 6465-6474 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.39501 Reverse Order Law for {1, 3}-Inverse of a Two-Operator Product 1 XUE
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationChapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 11 Output Analysis for a Single Model Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Objective: Estimate system performance via simulation If q is the system performance,
More informationqueue KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology
Analysis of the Packet oss Process in an MMPP+M/M/1/K queue György Dán, Viktória Fodor KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology {gyuri,viktoria}@imit.kth.se
More informationImprovements in Newton-Rapshon Method for Nonlinear Equations Using Modified Adomian Decomposition Method
International Journal of Mathematical Analysis Vol. 9, 2015, no. 39, 1919-1928 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.54124 Improvements in Newton-Rapshon Method for Nonlinear
More informationRemarks on Fuglede-Putnam Theorem for Normal Operators Modulo the Hilbert-Schmidt Class
International Mathematical Forum, Vol. 9, 2014, no. 29, 1389-1396 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47141 Remarks on Fuglede-Putnam Theorem for Normal Operators Modulo the
More informationOn optimization of a Coxian queueing model with two phases
AppliedandComputationalMathematics 204; 3(2): 43-47 Published online March 20, 204 (http://www.sciencepublishinggroup.com/j/acm) doi: 0.648/j.acm.2040302. On optimization of a Coxian queueing model with
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationBirth-Death Processes
Birth-Death Processes Birth-Death Processes: Transient Solution Poisson Process: State Distribution Poisson Process: Inter-arrival Times Dr Conor McArdle EE414 - Birth-Death Processes 1/17 Birth-Death
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationA Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent Customers
Int. J. Open Problems Compt. Math., Vol. 3, No. 2, June 21 ISSN 1998-6262; Copyright c ICSRS Publication, 21 www.i-csrs.org A Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationMath 597/697: Solution 5
Math 597/697: Solution 5 The transition between the the ifferent states is governe by the transition matrix 0 6 3 6 0 2 2 P = 4 0 5, () 5 4 0 an v 0 = /4, v = 5, v 2 = /3, v 3 = /5 Hence the generator
More informationPerishable Inventory System at Service Facilities with Multiple Server Vacations and Impatient Customers
J. Stat. Appl. Pro. Lett. 3, o. 3, 63-73 (2014) 63 Journal of Statistics Applications & Probability Letters An International Journal http://dx.doi.org/10.12785/jsapl/010303 Perishable Inventory System
More informationOn Powers of General Tridiagonal Matrices
Applied Mathematical Sciences, Vol. 9, 5, no., 583-59 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.988/ams.5.49 On Powers of General Tridiagonal Matrices Qassem M. Al-Hassan Department of Mathematics
More informationA transient solution to the M/M/c queuing model equation with balking and catastrophes
Croatian Operational Research Review 577 CRORR 8(217), 577 591 A transient solution to the M/M/c queuing model equation with balking and catastrophes Rakesh Kumar 1, 1 School of Mathematics, Shri Mata
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationStochastic inventory system with two types of services
Int. J. Adv. Appl. Math. and Mech. 2() (204) 20-27 ISSN: 2347-2529 Available online at www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Stochastic inventory system
More informationOn the Inverting of a General Heptadiagonal Matrix
British Journal of Applied Science & Technology 18(5): 1-, 2016; Article no.bjast.313 ISSN: 2231-0843, NLM ID: 101664541 SCIENCEDOMAIN international www.sciencedomain.org On the Inverting of a General
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationA Family of Optimal Multipoint Root-Finding Methods Based on the Interpolating Polynomials
Applied Mathematical Sciences, Vol. 8, 2014, no. 35, 1723-1730 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.4127 A Family of Optimal Multipoint Root-Finding Methods Based on the Interpolating
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More information