The following pages link to J. George Shanthikumar (Q221936):
Displaying 50 items.
- Optimization with a class of multivariate integral stochastic order constraints (Q363558) (← links)
- Does more information-gathering effort raise or lower the average quantity produced? (Q516064) (← links)
- Generating improved dominance conditions for the flowshop problem (Q580164) (← links)
- On lifetimes influenced by a common environment (Q581938) (← links)
- Conditional value-at-risk in portfolio optimization: coherent but fragile (Q635502) (← links)
- Optimal risk transfer for agents with germs (Q661203) (← links)
- (Q761342) (redirect page) (← links)
- Analyses of priority queues with server control (Q761343) (← links)
- On a software availability model with imperfect maintenance (Q787851) (← links)
- The time spent in a dynamic job shop (Q794063) (← links)
- An algorithmic approach for a special class of Markov chains (Q797477) (← links)
- A central limit theorem for random sums of random variables (Q797897) (← links)
- Parametric stochastic convexity and concavity of stochastic processes (Q803654) (← links)
- Dynamic multivariate aging notions in relability theory (Q808603) (← links)
- Staffing decisions for heterogeneous workers with turnover (Q811973) (← links)
- Allocating a joint setup in a multi-cell system (Q920835) (← links)
- Solving operational statistics via a Bayesian analysis (Q924902) (← links)
- Discrete random variate generation using uniformization (Q1071468) (← links)
- Reducing work-in-process inventory in certain classes of flexible manufacturing systems (Q1084010) (← links)
- The preservation of likelihood ratio ordering under convolution (Q1087229) (← links)
- The multivariate hazard construction (Q1091020) (← links)
- Temporal stochastic convexity and concavity (Q1093262) (← links)
- DFR property of first-passage times and its preservation under geometric compounding (Q1098173) (← links)
- Comparing ordered-entry queues with heterogeneous servers (Q1116560) (← links)
- On reducing time spent in M/G/1 systems (Q1159410) (← links)
- A recursive algorithm to generate joint probability distribution of arrivals from exponential sources during a random time interval (Q1167062) (← links)
- Cyclic regenerative method of simulation (Q1170995) (← links)
- Shock models with MIFRA time to failure distributions (Q1193951) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Design of manufacturing systems using queueing models (Q1205352) (← links)
- Supplier diversification: Effect of discrete demand (Q1306450) (← links)
- Selectivity estimation of temporal data manipulations (Q1310953) (← links)
- Bounding the performance of tandem queues with finite buffer spaces (Q1315341) (← links)
- Convexity of single stage queueing systems with bulk arrival (Q1331290) (← links)
- Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic (Q1332445) (← links)
- Discrete storage processes and their Poisson flow and fluid flow approximations (Q1357711) (← links)
- Using information about machine failures to control flowlines (Q1361040) (← links)
- Supermodular stochastic orders and positive dependence of random vectors (Q1364669) (← links)
- Bounds and approximations for cycle times of a \(U\)-shaped production line (Q1382809) (← links)
- Sequential process control under capacity constraints. (Q1427593) (← links)
- Preface: Special issue in memory of Moshe Shaked (Q1617319) (← links)
- Arrangement increasing resource allocation (Q1617329) (← links)
- Allocation through stochastic Schur convexity and stochastic transposition increasingness (Q1624517) (← links)
- Estimating effective capacity in Erlang loss systems under competition (Q1766088) (← links)
- Level crossing analysis of some variants of GI/M/1 queues (Q1836935) (← links)
- Discrete hazard rate functions (Q1890968) (← links)
- Hazard rate ordering of \(k\)-out-of-\(n\) systems (Q1892107) (← links)
- Parametric Schur convexity and arrangement monotonicity properties of partial sums (Q1893367) (← links)
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems (Q2265944) (← links)
- Structural properties and stochastic bounds for a buffer problem in packetized voice transmission (Q2277231) (← links)
