M/m/1 Queues

M/M/1 Queues is a continuous-time queueing model characterized by a single server, Poisson arrival process, and exponentially distributed service times, belonging to the class of Markovian queueing systems distinguished by its specific (M/M/1) notation indicating memoryless interarrival and service times with one service channel.

527

Publications

18.6K

Citations

750

Authors

374

Institutions

Publications per year

2017–2026

62

Variants

M/m/1 Queue

Authors

750

  1. KW
    Kuo-Hsiung Wang

    National Chung Hsing University, Taiwan

    11 publications · 400 citations

    10

    h-index

  2. NT
    Naishuo Tian

    Yanshan University, China

    9 publications · 467 citations

    9

    h-index

  3. JK
    Jau‐Chuan Ke

    National Taichung University of Science and Technology, Taiwan

    9 publications · 271 citations

    9

    h-index

  4. UY
    Uri Yechiali

    Tel Aviv University, Israel

    8 publications · 827 citations

    8

    h-index

  5. JW
    Jinting Wang

    Beijing Jiaotong University, China

    8 publications · 232 citations

    8

    h-index

1–5 of 750

Venues

  1. Journal of Applied Probability

    JAP · 55 publications · 1.4K citations

    21

    h-index

  2. Advances in Applied Probability

    AAP · 30 publications · 1.4K citations

    20

    h-index

  3. Operations Research

    19 publications · 1.5K citations

    17

    h-index

  4. Queueing Systems

    30 publications · 1.1K citations

    16

    h-index

  5. Management Science

    14 publications · 1.6K citations

    14

    h-index

1–5