SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The amount of overtaking in a network of queues
11 references·5 citing·29 second hop
The amount of overtaking in a network of queues (1984)The amount of overtaking in a network of …Jobshop-Like Queueing Systems (2004)Jobshop-Like Queueing SystemsQueues and Point Processes (1983)Queues and Point ProcessesPoisson Arrivals See Time Averages (1982)Poisson Arrivals See Time Ave…Sojourn times and the overtaking condition in Jacksonian networks (1980)Sojourn times and the overtak…Note—Some Results on Sojourn Times in Acyclic Jackson Networks (1979)Note—Some Results on Sojourn …Note on Queues in Tandem (1963)Note on Queues in TandemJobshop-Like Queueing Systems (1963)Jobshop-Like Queueing SystemsThe effect of queue discipline on waiting time variance (1962)The effect of queue disciplin…Waiting Times When Queues are in Tandem (1957)Waiting Times When Queues are…Networks of Waiting Lines (1957)Networks of Waiting LinesThe Output of a Queuing System (1956)The Output of a Queuing SystemStrategic Overtaking in a Monopolistic M/M/1 Queue (2015)Strategic Overtaking in a Mon…A resource allocation queueing fairness measure: properties and bounds (2007)A resource allocation queuein…Fairness considerations of scheduling in multi-server and multi-queue systems (2006)Fairness considerations of sc…A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement (2005)A discrimination frequency ba…A resource-allocation queueing fairness measure (2004)A resource-allocation queuein…Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The Distribution of Queuing Network States at Input and Output Instants (1981)Passage times for overtake-free paths in Gordon–Newell networks (1982)The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks (1982)Sojourn times in closed queueing networks (1983)A Comparison Between Tandem Queues with Dependent and Independent Service Times (1982)The Time for a Round Trip in a Cycle of Exponential Queues (1983)The Operational Analysis of Queueing Network Models (1978)Lot Sizes, Lead Times and In-Process Inventories (1987)Inventory Management of Remanufacturable Products (2000)Queueing Models for Computer Communications System Analysis (1977)Queueing Networks: A Survey of Their Random Processes (1985)Queueing theory in manufacturing: A survey (1999)Fluctuation theory in continuous time (1975)An upper bound for multi-channel queues (1977)Fairness and scheduling in single server queues (2010)Closed Queuing Systems with Exponential Servers (1967)Open Queueing Networks in Heavy Traffic (1984)Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach (1967)Approximate Analysis of General Queuing Networks by Decomposition (1979)Make-to-order, make-to-stock, or delay product differentiation? A common framework for modeling and analysis (2004)A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance (1986)Queueing systems with vacations ? A survey (1986)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)Computational algorithms for closed queueing networks with exponential servers (1973)An introduction to queueing theory (1993)Processor-sharing queues: Some progress in analysis (1987)Asymptotic Behavior of an Allocation Policy for Revenue Management (2002)OR FORUM—Little's Law as Viewed on Its 50th Anniversary (2011)
this work references cited by second hop

References

  • 1982Poisson Arrivals See Time Averages1,220 cited
  • 1957Networks of Waiting Lines1,215 cited
  • 1963Jobshop-Like Queueing Systems898 cited
  • 2004Jobshop-Like Queueing Systems733 cited
  • 1956The Output of a Queuing System696 cited
  • 1983Queues and Point Processes258 cited
  • 1957Waiting Times When Queues are in Tandem222 cited
  • 1980Sojourn times and the overtaking condition in Jacksonian networks99 cited
  • 1962The effect of queue discipline on waiting time variance80 cited
  • 1963Note on Queues in Tandem63 cited
  • 1979Note—Some Results on Sojourn Times in Acyclic Jackson Networks48 cited

Cited by

  • 2004A resource-allocation queueing fairness measure35 cited
  • 2007A resource allocation queueing fairness measure: properties and bounds30 cited
  • 2005A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement26 cited
  • 2015Strategic Overtaking in a Monopolistic M/M/1 Queue21 cited
  • 2006Fairness considerations of scheduling in multi-server and multi-queue systems

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

19 cited