| Publication | Date of Publication | Type |
|---|
Ordering of tandem constant-service stations to minimize in-process stock cost
Probability in the Engineering and Informational Sciences | 2016-05-11 | Paper |
Strategic Equilibrium for a Pair of Competing Servers with Convex Cost and Balking
Management Science | 2012-02-19 | Paper |
QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
Probability in the Engineering and Informational Sciences | 2008-11-25 | Paper |
Strategic equilibrium versus global optimum for a pair of competing servers
Journal of Applied Probability | 2008-02-15 | Paper |
Locality of reference and the use of sojourn time variance for measuring queue unfairness
Operations Research Letters | 2008-01-21 | Paper |
A resource allocation queueing fairness measure: properties and bounds
Queueing Systems | 2007-09-06 | Paper |
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times
Mathematics of Operations Research | 2005-11-11 | Paper |
On measuring fairness in queues
Advances in Applied Probability | 2005-03-30 | Paper |
A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited
Management Science | 1996-10-20 | Paper |
A Note on Evaluating the Overflow Probability Using the Infinite Queue
Management Science | 1996-10-20 | Paper |
Servers in tandem with <i>k-</i>stage blocking and communications-type flow
Journal of Applied Probability | 1995-06-30 | Paper |
Servers in tandem with communication and manufacturing blocking
Journal of Applied Probability | 1993-10-11 | Paper |
| scientific article; zbMATH DE number 19795 (Why is no real title available?) | 1992-06-26 | Paper |
Approximations for moments of response times in time sharing queues with limited number of service positions
Communications in Statistics. Stochastic Models | 1991-01-01 | Paper |
Response times in gated M/G/1 queues: The processor-sharing case
Queueing Systems | 1989-01-01 | Paper |
Response times in <i>M/M/</i>1 time-sharing schemes with limited number of service positions
Journal of Applied Probability | 1988-01-01 | Paper |
Server sharing with a limited number of service positions and symmetric queues
Journal of Applied Probability | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3453054 (Why is no real title available?) | 1974-01-01 | Paper |
Approximate Queuing Models for Multiprogramming Computer Systems
Operations Research | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3375237 (Why is no real title available?) | 1971-01-01 | Paper |
Heavy Traffic Characteristics of a Circular Data Network
Bell System Technical Journal | 1971-01-01 | Paper |
A Time-Sharing Queue
Management Science | 1969-01-01 | Paper |
Algorithms for Stochastic Games with Geometrical Interpretation
Management Science | 1969-01-01 | Paper |
A Time-Sharing Queue with a Finite Number of Customers
Journal of the ACM | 1969-01-01 | Paper |
A Time-Sharing Model with Many Queues
Operations Research | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3379971 (Why is no real title available?) | 1968-01-01 | Paper |
A Many-Server Queue with Service Interruptions
Operations Research | 1968-01-01 | Paper |
Queuing Systems with Enforced Idle Time
Operations Research | 1967-01-01 | Paper |
A Sequence of Service Stations with Arbitrary Input and Regular Service Times
Management Science | 1965-01-01 | Paper |
A Sequence of Two Servers with No Intermediate Queue
Management Science | 1965-01-01 | Paper |
Queuing with Alternating Priorities
Operations Research | 1965-01-01 | Paper |
| scientific article; zbMATH DE number 3285843 (Why is no real title available?) | 1964-01-01 | Paper |
On Discretionary Priority Queueing
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik | 1964-01-01 | Paper |
Some Queuing Problems with the Service Station Subject to Breakdown
Operations Research | 1963-01-01 | Paper |
Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem—I
Operations Research | 1963-01-01 | Paper |
On a Problem of Preemptive Priority Queuing
Operations Research | 1961-01-01 | Paper |
