The following pages link to Benjamin Avi-Itzhak (Q1826228):
Displayed 36 items.
- Response times in gated M/G/1 queues: The processor-sharing case (Q1826230) (← links)
- Locality of reference and the use of sojourn time variance for measuring queue unfairness (Q2467469) (← links)
- A resource allocation queueing fairness measure: properties and bounds (Q2643009) (← links)
- Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost (Q2805369) (← links)
- Strategic Equilibrium for a Pair of Competing Servers with Convex Cost and Balking (Q3114789) (← links)
- Approximations for moments of response times in time sharing queues with limited number of service positions (Q3209974) (← links)
- On a Problem of Preemptive Priority Queuing (Q3285017) (← links)
- QUANTIFYING FAIRNESS IN QUEUING SYSTEMS (Q3540999) (← links)
- Server sharing with a limited number of service positions and symmetric queues (Q3779553) (← links)
- Response times in <i>M/M/</i>1 time-sharing schemes with limited number of service positions (Q3802367) (← links)
- (Q3979298) (← links)
- Servers in tandem with <i>k-</i>stage blocking and communications-type flow (Q4322059) (← links)
- On measuring fairness in queues (Q4662245) (← links)
- (Q4776783) (← links)
- Approximate Queuing Models for Multiprogramming Computer Systems (Q4776846) (← links)
- A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited (Q4896408) (← links)
- A Note on Evaluating the Overflow Probability Using the Infinite Queue (Q4896424) (← links)
- Servers in tandem with communication and manufacturing blocking (Q5288020) (← links)
- On Discretionary Priority Queueing (Q5338474) (← links)
- Queuing with Alternating Priorities (Q5339829) (← links)
- Strategic equilibrium versus global optimum for a pair of competing servers (Q5441530) (← links)
- A Sequence of Service Stations with Arbitrary Input and Regular Service Times (Q5536014) (← links)
- A Sequence of Two Servers with No Intermediate Queue (Q5568443) (← links)
- (Q5568446) (← links)
- A Time-Sharing Queue (Q5569966) (← links)
- A Time-Sharing Queue with a Finite Number of Customers (Q5571504) (← links)
- Algorithms for Stochastic Games with Geometrical Interpretation (Q5572845) (← links)
- A Time-Sharing Model with Many Queues (Q5575244) (← links)
- Queuing Systems with Enforced Idle Time (Q5578163) (← links)
- (Q5646665) (← links)
- A Many-Server Queue with Service Interruptions (Q5649796) (← links)
- (Q5649801) (← links)
- Heavy Traffic Characteristics of a Circular Data Network (Q5655171) (← links)
- Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times (Q5704044) (← links)
- Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem—I (Q5721505) (← links)
- Some Queuing Problems with the Service Station Subject to Breakdown (Q5722618) (← links)