The following pages link to Jan-Kees C. W. van Ommeren (Q213295):
Displaying 35 items.
- (Q319385) (redirect page) (← links)
- An approximate policy for a dual-sourcing inventory model with positive lead times and binomial yield (Q319386) (← links)
- Analytical models to determine room requirements in outpatient clinics (Q427498) (← links)
- The discrete-time single-server queue (Q809487) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- (Q1039624) (redirect page) (← links)
- A polling model with an autonomous server (Q1039625) (← links)
- On a tandem queue with batch service and its applications in wireless sensor networks (Q1640078) (← links)
- Waiting times in classical priority queues via elementary lattice path counting (Q1691914) (← links)
- Exponential bounds for excess probabilities in systems with a finite capacity (Q1819837) (← links)
- A successive censoring algorithm for a system of connected LDQBD-processes (Q2115770) (← links)
- Batch service systems with heterogeneous servers (Q2210671) (← links)
- An exact root-free method for the expected queue length for a class of discrete-time queueing systems (Q2284388) (← links)
- Analysis of polling models with a self-ruling server (Q2302272) (← links)
- An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
- Closed loop two-echelon repairable item systems (Q2576675) (← links)
- Locating repair shops in a stochastic environment (Q2581600) (← links)
- An inventory model with discounts for omnichannel retailers of slow moving items (Q2670560) (← links)
- DELAY IN A TANDEM QUEUEING MODEL WITH MOBILE QUEUES: AN ANALYTICAL APPROXIMATION (Q2875241) (← links)
- A linear programming approach to error bounds for random walks in the quarter-plane (Q2956003) (← links)
- Transient analysis for exponential time-limited polling models under the preemptive repeat random policy (Q3298813) (← links)
- Simple Approximations for the Batch-Arrival Mx/G/1 Queue (Q3349740) (← links)
- Asymptotic Results for Buffer Systems under Heavy Load (Q3415851) (← links)
- Asymptotic Analysis for Buffer Behavior in Communication Systems (Q3415911) (← links)
- Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals (Q3814522) (← links)
- Loss probabilities in batch-arrival bulk-service queues with finite capacity (Q4340659) (← links)
- A TWO-ECHELON SPARE PARTS NETWORK WITH LATERAL AND EMERGENCY SHIPMENTS: A PRODUCT-FORM APPROXIMATION (Q5050855) (← links)
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925) (← links)
- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem (Q5434400) (← links)
- A Tandem Queue with Server Slow-Down and Blocking (Q5462813) (← links)
- On First-Come First-Served Versus Random Service Discipline in Multiclass Closed Queueing Networks (Q5488543) (← links)
- Algorithmic Applications in Management (Q5710133) (← links)
- On the waiting time distribution in a GI/G/1 queue with a Coxian–2 service time distribution (Q5753340) (← links)
- The remaining service time upon reaching a high level in \(M/G/1\) queues (Q5948167) (← links)
