Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A new ordering for stochastic majorization: theory and applications

13 references·5 citing·28 second hop

FromToDepth

this work references cited by second hop

References

1986Comparison Methods for Queues and Other Stochastic Models.938 cited
1984Comparison Methods for Queues and Other Stochastic Models720 cited
1977Optimality of the shortest line discipline495 cited
1978On the optimal assignment of customers to parallel servers337 cited
1988Approximate analysis of fork/join synchronization in parallel queues332 cited
1980A simple dynamic routing problem315 cited
1986Deciding Which Queue to Join: Some Counterexamples235 cited
1986Deciding which queue to join: Some counterexamples189 cited
1989The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds162 cited
1989Queueing models for systems with synchronization constraints134 cited
1981Queues with non-stationary input stream: Ross's conjecture66 cited
1986Upper Bounds for Single Server Queues with Doubly Stochastic Poisson Arrivals59 cited
1991Strong stochastic convexity: closure properties and applications59 cited

Cited by

1995Sample path methods in the control of queues44 cited
1999Structural Analysis of a Queueing System with Multiclasses of Correlated Arrivals and Blocking

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

35 cited

1993On the duality between routing and scheduling systems with finite buffer space26 cited

1994Analysis of a Customer Assignment Model with No State Information22 cited

1994Sample Path Criteria for Weak Majorization19 cited