DEPARTMENT OF MANAGEMENT INFORMATION SYSTEM (MIS)
Masters of Business Administration (EMBA)
Subject: Management Science (EMIS 517)
Queuing Theory and The use of Queuing Theory of BFC Bangladesh”
Supervised By : Md. Abdul Hannan Mia
B. Com.(Hons), M.com, PGD, MSc, MBA, FCMA, Ph.D.
1. Abdul Mannan Mian ID NO: 61428-21-044 Merit: 519 2. Mehedi Hasan ID NO: 61428-21-36 Merit: 480 3. Mobarok hossain ID NO:61428-21-045 Merit: 4. Pankaz Debnath ID NO: 61427-20-042
Letter of Transmittal
9th December, 2014
Dr. Abdul Hannan Mia
Department of Management Information Systems (MIS)
Faculty of Business Studies
University of Dhaka
Dhaka 1000, Bangladesh
Subject: Letter of transmittal.
Please find enclosed with this letter the assignment of “Queuing Theory” that you wanted as partial requirement for the course of “Management Science: MIS-307”. The name of our assignment is “Queuing Theory and the use of queuing theory of an organization." We collected all the relevant information from BFC (Best Fried Chicken) from 4th December to 6th December, 2014. We think this assignment contains the information that you required. Yours sincerely,
Abdul Mannan Mian
We wish to acknowledge the immeasurable grace and profound kindness of the Almighty Allah, the supreme ruler of the universe, who created me and enables me to make my dream in a reality. In Addition, we especially thanks to our honorable course instructor Dr. Abdul Hannan Mia, Professor Department of Management Information Systems (MIS), Faculty of Business Studies, University of Dhaka
We are privileged enjoying assistance and guidance of all the group members for supporting and giving pleasurable working experiences and helping each other prepare this assignment on “Queuing Theory and The use of Queuing Theory of an Organization” from the beginning of our preparation.
Table of Contents
Letter of Transmittal
Elements of waiting line analysis
The single server waiting line system
The Multiple Server Waiting line
Queuing in BFC (Best Fried Chicken)
We have seen that as a system gets congested, the service delay in the system increases. A good understanding of the relationship between congestion and delay is essential for designing effective congestion control algorithms. Queuing Theory provides all the tools needed for this analysis. This article will focus on understanding the basics of this topic. Queuing analysis is a probabilistic from of analysis, not a deterministic technique. Thus the results of queuing analysis, referred to as operating characteristics, are probabilistic. These operating statistics (such as the average time a person must wait in the line to be served) are used by the manager of the operation containing the queue to make decision.
Providing quick service is an important aspect of quality customer service. A number of different queuing model exist to deal with different queuing system. There are two common types of system – the single server system and the multiple server system.
Queuing Theory and Practice: A Source of Competitive Advantage Everyone has experienced waiting in line, whether at a fast-food restaurant, on the phone for technical help, at the doctor’s office or in the drive-through lane of a bank. Sometimes, it is a pleasant experience, but many times it can be extremely frustrating for both the customer and the store manager. Given the intensity of competition today, a customer waiting too long in line is...
References: 1. Sundarapandian, V. (2009). "7. Queueing Theory". Probability, Statistics and Queueing Theory. PHI Learning. ISBN 8120338448.
2. Lawrence W. Dowdy, Virgilio A.F. Almeida, Daniel A. Menasce (Thursday Janery 15, 2004). "Performance by Design: Computer Capacity Planning By Example". p. 480. Check date values in: |date= (help)
4. Mayhew, Les; Smith, David (December 2006). Using queuing theory to analyse completion times in accident and emergency departments in the light of the Government 4-hour target. Cass Business School. ISBN 978-1-905752-06-5. Retrieved 2008-05-20.
5. Tijms, H.C, Algorithmic Analysis of Queues", Chapter 9 in A First Course in Stochastic Models, Wiley, Chichester, 2003
7. A.A. Markov, Extension of the law of large numbers to dependent quantities, Izvestiia Fiz.-Matem. Obsch. Kazan Univ., (2nd Ser.), 15(1906), pp. 135–156 [Also , pp. 339–361].
8. "Agner Krarup Erlang (1878 - 1929) | plus.maths.org". Pass.maths.org.uk. Retrieved 2013-04-22.
9. Asmussen, S. R.; Boxma, O. J. (2009). "Editorial introduction". Queueing Systems 63: 1. doi:10.1007/s11134-009-9151-8.
11. Kingman, J. F. C. (2009). "The first Erlang century—and the next". Queueing Systems 63: 3–4. doi:10.1007/s11134-009-9147-4.
13. Little, J. D. C. (1961). "A Proof for the Queuing Formula: L = λW". Operations Research 9 (3): 383–387. doi:10.1287/opre.9.3.383. JSTOR 167570.
14. Kingman, J. F. C.; Atiyah (October 1961). "The single server queue in heavy traffic". Mathematical Proceedings of the Cambridge Philosophical Society 57 (4): 902. doi:10.1017/S0305004100036094. JSTOR 2984229.
15. Ramaswami, V. (1988). "A stable recursion for the steady state vector in markov chains of m/g/1 type". Communications in Statistics. Stochastic Models 4: 183–188. doi:10.1080/15326348808807077.
17. Harchol-Balter, M. (2012). "Performance Modeling and Design of Computer Systems".
Please join StudyMode to read the full document