Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
April 1, 1967Operations Research

Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach

View Full Paper
Ask AI
Bookmark
Share

Authors

FHFrederick S. HillierPalo Alto UniversityRBRonald W. BolingKnoxville College

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Hillier et al. (1967) studied this question.

synapsesocial.com/papers/6a71166bfe4101aa97e06e30https://doi.org/10.1287/opre.15.2.286
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A Sequence of Service Stations with Arbitrary Input and Regular Service Times1965 · 104 citations
  2. 2Reduction Methods for Tandem Queuing Systems1965 · 101 citations
  3. 3The Output of a Queuing System1956 · 713 citations
  4. 4Introduction to Operations Research1968 · 3,334 citations
  5. 5Sequential Arrays of Waiting Lines1956 · 283 citations