The following pages link to (Q4101255):
Displaying 50 items.
- Simple and yet efficient estimators for Markovian multiserver queues (Q1720759) (← links)
- Equilibrium joining strategies in batch service queueing systems (Q1753541) (← links)
- Differentiated or integrated: capacity and service level choice for differentiated products (Q1754179) (← links)
- Comparing short-memory charts to monitor the traffic intensity of single server queues (Q1757219) (← links)
- Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems (Q1761231) (← links)
- Analytical modeling of joint reception, staging, onward movement, and integration (Q1767097) (← links)
- A subrating channel assignment scheme for cellular radio network with directed retry (Q1772871) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
- A general methodology for population analysis (Q1783207) (← links)
- Fast engset computation (Q1790185) (← links)
- A production/inventory policy for stochastic demand and multiple products (Q1803745) (← links)
- Three methods to share joint costs or surplus (Q1806203) (← links)
- A \((T,S)\) inventory/production system with limited production capacity and uncertain demands (Q1807929) (← links)
- A maximum entropy priority approximation for a stable G/G/1 queue (Q1823135) (← links)
- A general counter model for refractory phenomena (Q1823897) (← links)
- Response times in gated M/G/1 queues: The processor-sharing case (Q1826230) (← links)
- Poisson regulation in mother-infant gaze systems (Q1827307) (← links)
- One moment model for telephone traffic (Q1835833) (← links)
- Approximating the stationary waiting time distribution function of GI/GI/1-queues with arithmetic interarrival time and service time distribution function (Q1837479) (← links)
- The GI/G/1 queue with last-come-first-served (Q1838233) (← links)
- Approximation von Leistungsgroessen symmetrischer Mehrprozessorsysteme (Q1838287) (← links)
- On derivative estimation of single-server queues via structural infinitesimal perturbation analysis (Q1842518) (← links)
- Sojourn times in queues with instantaneous tri-route decision process (Q1842799) (← links)
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions (Q1847143) (← links)
- Performance analysis and optimization of web proxy servers and mirror sites (Q1848375) (← links)
- The effect of product variety on supply-chain performance (Q1848403) (← links)
- Performance measure sensitive congruences for Markovian process algebras (Q1853585) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- An upper bound for entropy of discrete distributions having assigned moments (Q1855874) (← links)
- Asynchronous transfer mode networks with parallel links and multiple service classes (Q1869520) (← links)
- Excursions of the workload process in \(G/GI/1\) queues (Q1899261) (← links)
- Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks (Q1901413) (← links)
- An operational view of the \(M/G/1/PS\) queueing model with IO overhead as part of service (Q1903264) (← links)
- Global behavior of homogeneous random neural systems (Q1903277) (← links)
- Asymptotic analysis of the effect of arrival model uncertainties in some optimal routing problems (Q1904961) (← links)
- Interrelationship between controlling arrival and service in queueing systems (Q1905080) (← links)
- Forward equations for reflected diffusions with jumps (Q1909386) (← links)
- Bounds for optimal flow control window size design with application to high-speed networks (Q1912565) (← links)
- Genetic algorithms and call admission to telecommunications networks (Q1915967) (← links)
- Bounds for the mean system size in \(M/G/1/K\)-queues (Q1917909) (← links)
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion (Q1919174) (← links)
- Markovian queueing models with periodic-review (Q1919784) (← links)
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations (Q1919823) (← links)
- Simple analysis of a fluid queue driven by an \(M/M/1\) queue (Q1919827) (← links)
- Taylor series expansions for Poisson-driven (max,+)-linear systems (Q1921436) (← links)
- Sensitivity analysis of stationary performance measures for Markov chains (Q1922200) (← links)
- A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline (Q1926998) (← links)
- Simulation-based transfer function modeling for transient analysis of general queueing systems (Q1927001) (← links)
- Analysis of queueing systems with customer interjections (Q1934374) (← links)
