Teoria statului la coadă (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Teoria statului la coadă" in Romanian language version.

refsWebsite

Global rank Romanian rank

19doi.org

2^nd place

3^rd place

8jstor.org

26^th place

69^th place

2web.archive.org

1^st place

1gmu.edu

3,837^th place

6,007^th place

1pennlive.com

2,939^th place

low place

1city.ac.uk

low place

1projecteuclid.org

3,707^th place

8,468^th place

1maths.org.uk

low place

1dtu.dk

low place

1books.google.com

3^rd place

6^th place

1umass.edu

3,341^st place

7,844^th place

books.google.com

Manuel, Laguna (2011). Business Process Modeling, Simulation and Design (în engleză). Pearson Education India. p. 178. ISBN 9788131761359. Accesat în 6 octombrie 2017.

city.ac.uk

openaccess.city.ac.uk

Mayhew, Les; Smith, David (decembrie 2006). Using queuing theory to analyse completion times in accident and emergency departments in the light of the Government 4-hour target. Bayes Business School (formerly Cass). ISBN 978-1-905752-06-5. Accesat în 20 mai 2008.

doi.org

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. doi:10.1214/aoms/1177728975. JSTOR 2236285.
Asmussen, S. R.; Boxma, O. J. (2009). „Editorial introduction”. Queueing Systems. 63: 1. doi:10.1007/s11134-009-9151-8.
Kingman, J. F. C. (2009). „The first Erlang century—and the next”. Queueing Systems. 63: 3–4. doi:10.1007/s11134-009-9147-4.
Harchol-Balter, M. (2012). „Scheduling: Non-Preemptive, Size-Based Policies”. Performance Modeling and Design of Computer Systems. p. 499. doi:10.1017/CBO9781139226424.039. ISBN 9781139226424.
Harchol-Balter, M. (2012). „Scheduling: Preemptive, Size-Based Policies”. Performance Modeling and Design of Computer Systems. p. 508. doi:10.1017/CBO9781139226424.040. ISBN 9781139226424.
Harchol-Balter, M. (2012). „Scheduling: SRPT and Fairness”. Performance Modeling and Design of Computer Systems. p. 518. doi:10.1017/CBO9781139226424.041. ISBN 9781139226424.
Jackson, J. R. (1957). „Networks of Waiting Lines”. Operations Research. 5 (4): 518–521. doi:10.1287/opre.5.4.518. JSTOR 167249.
Jackson, James R. (1963). „Jobshop-like Queueing Systems”. Management Science. 10 (1): 131–142. doi:10.1287/mnsc.1040.0268. JSTOR 2627213.
Reiser, M.; Lavenberg, S. S. (1980). „Mean-Value Analysis of Closed Multichain Queuing Networks”. Journal of the ACM. 27 (2): 313. doi:10.1145/322186.322195.
Van Dijk, N. M. (1993). „On the arrival theorem for communication networks”. Computer Networks and ISDN Systems. 25 (10): 1135–2013. doi:10.1016/0169-7552(93)90073-D.
Gordon, W. J.; Newell, G. F. (1967). „Closed Queuing Systems with Exponential Servers”. Operations Research. 15 (2): 254. doi:10.1287/opre.15.2.254. JSTOR 168557.
Baskett, F.; Chandy, K. Mani; Muntz, R.R.; Palacios, F.G. (1975). „Open, closed and mixed networks of queues with different classes of customers”. Journal of the ACM. 22 (2): 248–260. doi:10.1145/321879.321887.
Buzen, J. P. (1973). „Computational algorithms for closed queueing networks with exponential servers” (PDF). Communications of the ACM. 16 (9): 527. doi:10.1145/362342.362345. Arhivat din original (PDF) la 13 mai 2016. Accesat în 19 mai 2018.
Kelly, F. P. (1975). „Networks of Queues with Customers of Different Types”. Journal of Applied Probability. 12 (3): 542–554. doi:10.2307/3212869. JSTOR 3212869.
Gelenbe, Erol (1993). „G-Networks with Triggered Customer Movement”. Journal of Applied Probability. 30 (3): 742–748. doi:10.2307/3214781. JSTOR 3214781.
Bobbio, A.; Gribaudo, M.; Telek, M. S. (2008). „Analysis of Large Scale Interacting Systems by Mean Field Method”. 2008 Fifth International Conference on Quantitative Evaluation of Systems. p. 215. doi:10.1109/QEST.2008.47. ISBN 978-0-7695-3360-5.
en Bramson, M. (1999). „A stable queueing network with unstable fluid model”. The Annals of Applied Probability. 9 (3): 818. doi:10.1214/aoap/1029962815. JSTOR 2667284.
en Chen, H.; Whitt, W. (1993). „Diffusion approximations for open queueing networks with service interruptions”. Queueing Systems. 13 (4): 335. doi:10.1007/BF01149260.
en Yamada, K. (1995). „Diffusion Approximation for Open State-Dependent Queueing Networks in the Heavy Traffic Situation”. The Annals of Applied Probability. 5 (4): 958. doi:10.1214/aoap/1177004602. JSTOR 2245101.

dtu.dk

oldcom.dtu.dk

Erlang, Agner Krarup (1909). „The theory of probabilities and telephone conversations” (PDF). Nyt Tidsskrift for Matematik B. 20: 33–39. Arhivat din original (PDF) la 1 octombrie 2011.

gmu.edu

cs.gmu.edu

Lawrence W. Dowdy, Virgilio A.F. Almeida, Daniel A. Menasce. „Performance by Design: Computer Capacity Planning by Example”.

jstor.org

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. doi:10.1214/aoms/1177728975. JSTOR 2236285.
Jackson, J. R. (1957). „Networks of Waiting Lines”. Operations Research. 5 (4): 518–521. doi:10.1287/opre.5.4.518. JSTOR 167249.
Jackson, James R. (1963). „Jobshop-like Queueing Systems”. Management Science. 10 (1): 131–142. doi:10.1287/mnsc.1040.0268. JSTOR 2627213.
Gordon, W. J.; Newell, G. F. (1967). „Closed Queuing Systems with Exponential Servers”. Operations Research. 15 (2): 254. doi:10.1287/opre.15.2.254. JSTOR 168557.
Kelly, F. P. (1975). „Networks of Queues with Customers of Different Types”. Journal of Applied Probability. 12 (3): 542–554. doi:10.2307/3212869. JSTOR 3212869.
Gelenbe, Erol (1993). „G-Networks with Triggered Customer Movement”. Journal of Applied Probability. 30 (3): 742–748. doi:10.2307/3214781. JSTOR 3214781.
en Bramson, M. (1999). „A stable queueing network with unstable fluid model”. The Annals of Applied Probability. 9 (3): 818. doi:10.1214/aoap/1029962815. JSTOR 2667284.
en Yamada, K. (1995). „Diffusion Approximation for Open State-Dependent Queueing Networks in the Heavy Traffic Situation”. The Annals of Applied Probability. 5 (4): 958. doi:10.1214/aoap/1177004602. JSTOR 2245101.

maths.org.uk

pass.maths.org.uk

„Agner Krarup Erlang (1878 - 1929) | plus.maths.org”. Pass.maths.org.uk. Accesat în 22 aprilie 2013.

pennlive.com

Schlechter, Kira (2 martie 2009). „Hershey Medical Center to open redesigned emergency room”. The Patriot-News.

projecteuclid.org

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. doi:10.1214/aoms/1177728975. JSTOR 2236285.

umass.edu

www-unix.ecs.umass.edu

Buzen, J. P. (1973). „Computational algorithms for closed queueing networks with exponential servers” (PDF). Communications of the ACM. 16 (9): 527. doi:10.1145/362342.362345. Arhivat din original (PDF) la 13 mai 2016. Accesat în 19 mai 2018.

web.archive.org

Erlang, Agner Krarup (1909). „The theory of probabilities and telephone conversations” (PDF). Nyt Tidsskrift for Matematik B. 20: 33–39. Arhivat din original (PDF) la 1 octombrie 2011.
Buzen, J. P. (1973). „Computational algorithms for closed queueing networks with exponential servers” (PDF). Communications of the ACM. 16 (9): 527. doi:10.1145/362342.362345. Arhivat din original (PDF) la 13 mai 2016. Accesat în 19 mai 2018.