Σύγκριση μεθόδων

	Μοντέλο Erlang C	Ουρά M/M/1: Το Μοντέλο Ουράς Μοναδικού Εξυπηρετητή	Μοντέλο Ουράς M/M/c: Μοντέλο Ουράς Πολλαπλών Εξυπηρετητών
Πεδίο	Επιχειρησιακή Έρευνα	Επιχειρησιακή Έρευνα	Επιχειρησιακή Έρευνα
Οικογένεια	Regression model	Regression model	Regression model
Έτος προέλευσης	1981	1953	1998
Δημιουργός	Agner Krarup Erlang; Cooper	A. K. Erlang; David Kendall (notation)	Queueing-theory tradition; Gross & Harris
Τύπος	Steady-state queueing model	Stochastic queueing model	Multi-server Markovian queueing model
Θεμελιώδης πηγή	Cooper, R. B. (1981). Introduction to Queueing Theory (2nd ed.). North-Holland. ISBN: 978-0-444-00379-7	Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. The Annals of Mathematical Statistics, 24(3), 338–354.	Gross, D., & Harris, C. M. (1998). Fundamentals of Queueing Theory (3rd ed.). Wiley. ISBN: 978-0-471-17083-9
Εναλλακτικές ονομασίες	M/M/c Queue, Multi-Server Queueing Model, Erlang Delay Formula, Erlang-C Bekleme Modeli	Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli	Multi-Server Erlang Queue, c-Server Markovian Queue, Erlang-C Queue, Çok Sunuculu M/M/c Kuyruğu
Συναφείς	3	3	3
Σύνοψη	The Erlang C model is a steady-state queueing formula that determines the probability a customer must wait before being served in a system with c parallel servers, Poisson arrivals at rate lambda, and exponentially distributed service times. Originally developed by Danish engineer Agner Krarup Erlang in the early twentieth century for telephone exchange design, and formalized in the queueing theory literature by Cooper (1981), it remains the canonical staffing model for call centers and service operations worldwide.	The M/M/1 queue is the foundational single-server queueing model in which customers arrive according to a Poisson process with rate λ, are served one at a time by a single server with exponentially distributed service times at rate μ, and wait in an infinite-capacity first-come-first-served queue. Formalized within the Kendall notation framework by David Kendall in 1953, building on A. K. Erlang's early twentieth-century telephone traffic work, it yields closed-form steady-state performance measures when the traffic intensity ρ = λ/μ is less than one.	The M/M/c queue is a multi-server stochastic model in which customers arrive according to a Poisson process at rate λ, are served by c identical servers each with exponentially distributed service times at rate μ, and wait in a single common queue when all servers are busy. Systematized within classical queueing theory and thoroughly treated by Gross and Harris (1998), it extends the simpler M/M/1 model to settings with parallel servers, making it the foundational tool for capacity planning in service systems.