The following pages link to Gideon Weiss (Q210308):
Displaying 40 items.
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- A product form solution to a system with multi-type jobs and multi-type servers (Q383231) (← links)
- Stability of multi-class queueing networks with infinite virtual queues (Q471429) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- On the optimal order of M machines in tandem (Q751991) (← links)
- A push-pull network with infinite supply of work (Q833106) (← links)
- Optimal scheduling of peer-to-peer file dissemination (Q835584) (← links)
- Near optimal control of queueing networks over a finite time horizon (Q839876) (← links)
- Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy (Q854999) (← links)
- Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
- A simplex based algorithm to solve separated continuous linear programs (Q930346) (← links)
- The asymptotic variance rate of the output process of finite capacity birth-death queues (Q946468) (← links)
- Dynamic priority rules when polling with multiple parallel servers (Q1200777) (← links)
- Multiple feedback at a single-server station (Q1240487) (← links)
- Fluid approximations for a processor-sharing queue (Q1383330) (← links)
- Many-server scaling of the N-system under FCFS-ALIS (Q1698765) (← links)
- A push-pull queueing system (Q1870012) (← links)
- An algorithm for minimum wait draining of two-station fluid re-entrant line (Q1960311) (← links)
- Design heuristic for parallel many server systems (Q1991286) (← links)
- Directed FCFS infinite bipartite matching (Q2052427) (← links)
- Parallel multi-type many server conjecture (Q2146395) (← links)
- Local stability in a transient Markov chain (Q2197622) (← links)
- A simplex-type algorithm for continuous linear programs with constant coefficients (Q2297646) (← links)
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences (Q2917639) (← links)
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments (Q2921189) (← links)
- Symmetric Strong Duality for a Class of Continuous Linear Programs with Constant Coefficients (Q2934472) (← links)
- A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS (Q3087803) (← links)
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints (Q3220335) (← links)
- Addendum to ‘On an index policy for restless bandits' (Q3351174) (← links)
- Jackson networks with unlimited supply of work (Q3367758) (← links)
- Branching Bandit Processes (Q3415889) (← links)
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines (Q3415915) (← links)
- Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on <i>M</i> + 1 Parallel Machines (Q3416042) (← links)
- A Probabilistic Analysis of Two-Machine Flowshops (Q4346342) (← links)
- STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK : THE CASE OF EXPONENTIAL PROCESSING TIMES(<Special Issue>Network Design, Control and Optimization) (Q4671024) (← links)
- Stability and Instability of Fluid Models for Reentrant Lines (Q4880880) (← links)
- Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities (Q4994154) (← links)
- Fluid Models of Parallel Service Systems Under FCFS (Q5080673) (← links)
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching (Q5219556) (← links)
- Sojourn Time Estimation in an M/G/∞ Queue with Partial Information (Q5407027) (← links)
