Théorie des files d'attente (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Théorie des files d'attente" in French language version.

refsWebsite

Global rank French rank

9doi.org

2^nd place

3^rd place

4jstor.org

26^th place

110^th place

2mit.edu

415^th place

809^th place

1handle.net

102^nd place

779^th place

doi.org

dx.doi.org

Cf. D. Simchi-Levi et M. A. Trick, « Introduction to "Little's Law as Viewed on Its 50th Anniversary" », Operations Research, vol. 59, n^o 3,‎ 2013, p. 535 (DOI 10.1287/opre.1110.0941)
Cf. R. Serfozo, Introduction to Stochastic Networks, 1999, 301 p. (ISBN 978-1-4612-7160-4, DOI 10.1007/978-1-4612-1482-3_5), « Little Laws », p. 135–154
Cf. J. Keilson et L. D. Servi, « A distributional form of Little's Law », Operations Research Letters, vol. 7, n^o 5,‎ 1988, p. 223 (DOI 10.1016/0167-6377(88)90035-1, hdl 1721.1/5305, lire en ligne)
D'après J. D. C. Little et S. C. Graves, Building Intuition, vol. 115, coll. « Int. Series in Op. Res. & Management Sc. », 2008 (ISBN 978-0-387-73698-3, DOI 10.1007/978-0-387-73699-0_5, lire en ligne), « Little's Law », p. 81
Cf. Alan Cobham, « Priority Assignment in Waiting Line Problems », Operations Research, vol. 2, n^o 1,‎ 1954, p. 70–76 (DOI 10.1287/opre.2.1.70)
Cf. J. D. C. Little, « A Proof for the Queuing Formula: L = λW », Operations Research, vol. 9, n^o 3,‎ 1961, p. 383–387 (DOI 10.1287/opre.9.3.383, JSTOR 167570)
Cf. William S. Jewell, « A Simple Proof of: L = λW », Operations Research, vol. 15, n^o 6,‎ 1967, p. 1109–1116 (DOI 10.1287/opre.15.6.1109, JSTOR 168616)
Cf. Samuel Eilon, « A Simpler Proof of L = λW », Operations Research, vol. 17, n^o 5,‎ 1969, p. 915–917 (DOI 10.1287/opre.17.5.915, JSTOR 168368)
(en) David George Kendall, « Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain », The Annals of Mathematical Statistics, vol. 24, n^o 3,‎ 1953, p. 338 (DOI 10.1214/aoms/1177728975, JSTOR 2236285).

handle.net

hdl.handle.net

Cf. J. Keilson et L. D. Servi, « A distributional form of Little's Law », Operations Research Letters, vol. 7, n^o 5,‎ 1988, p. 223 (DOI 10.1016/0167-6377(88)90035-1, hdl 1721.1/5305, lire en ligne)

jstor.org

Cf. J. D. C. Little, « A Proof for the Queuing Formula: L = λW », Operations Research, vol. 9, n^o 3,‎ 1961, p. 383–387 (DOI 10.1287/opre.9.3.383, JSTOR 167570)
Cf. William S. Jewell, « A Simple Proof of: L = λW », Operations Research, vol. 15, n^o 6,‎ 1967, p. 1109–1116 (DOI 10.1287/opre.15.6.1109, JSTOR 168616)
Cf. Samuel Eilon, « A Simpler Proof of L = λW », Operations Research, vol. 17, n^o 5,‎ 1969, p. 915–917 (DOI 10.1287/opre.17.5.915, JSTOR 168368)
(en) David George Kendall, « Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain », The Annals of Mathematical Statistics, vol. 24, n^o 3,‎ 1953, p. 338 (DOI 10.1214/aoms/1177728975, JSTOR 2236285).

mit.edu

dspace.mit.edu

Cf. J. Keilson et L. D. Servi, « A distributional form of Little's Law », Operations Research Letters, vol. 7, n^o 5,‎ 1988, p. 223 (DOI 10.1016/0167-6377(88)90035-1, hdl 1721.1/5305, lire en ligne)

web.mit.edu

D'après J. D. C. Little et S. C. Graves, Building Intuition, vol. 115, coll. « Int. Series in Op. Res. & Management Sc. », 2008 (ISBN 978-0-387-73698-3, DOI 10.1007/978-0-387-73699-0_5, lire en ligne), « Little's Law », p. 81