The following pages link to Jaap Wessels (Q595526):
Displaying 36 items.
- (Q207029) (redirect page) (← links)
- On using discrete random models within decision support systems (Q595527) (← links)
- A compensation procedure for multiprogramming queues (Q684386) (← links)
- The construction of minimal multilayered perceptrons: A case study for sorting (Q689481) (← links)
- On theory and algorithms for Markov decision problems with the total reward criterion (Q1144500) (← links)
- Solving linear systems by methods based on a probabilistic interpretation (Q1144900) (← links)
- Multi-item lot size determination and scheduling under capacity constraints (Q1243659) (← links)
- Analyzing \(E_k/E_r/ c\) queues (Q1268238) (← links)
- The minimal number of layers of perceptron that sorts (Q1325994) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Shortest expected delay routing for Erlang servers (Q1362301) (← links)
- A novel decomposition approach for on-line lot-sizing. (Q1582194) (← links)
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying (Q2367401) (← links)
- Analysis of the asymmetric shortest queue problem (Q2640244) (← links)
- ORDER PICKING IN CAROUSEL SYSTEMS UNDER THE NEAREST ITEM HEURISTIC (Q2731302) (← links)
- Analysing Multiprogramming Queues by Generating Functions (Q3142785) (← links)
- On iterative optimization ol structured Markov decision processes with discounted rewards (Q3221982) (← links)
- (Q3312040) (← links)
- J.comput. appl. math (Q3490735) (← links)
- (Q3700562) (← links)
- Successive approximations for Markov decision processes and Markov games with unbounded rewards (Q3854944) (← links)
- (Q3856461) (← links)
- (Q3882194) (← links)
- Analysis of the asymmetric shortest queue problem with threshold jockeying (Q3987854) (← links)
- Discounted semi-Markov decision processes: linear programming and policy iteration (Q4060771) (← links)
- (Q4133440) (← links)
- FORMASY FOrecasting and Recruitment in MAnpower Systems (Q4133442) (← links)
- Note—A Note on Dynamic Programming with Unbounded Rewards (Q4151296) (← links)
- (Q4168770) (← links)
- (Q4173219) (← links)
- (Q4173220) (← links)
- (Q4198361) (← links)
- A compensation approach for two-dimensional Markov processes (Q4278392) (← links)
- Bounds for performance characteristics: a systematic approach via cost structures (Q4385217) (← links)
- A Lindley-type equation arising from a carousel problem (Q4660540) (← links)
- Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism (Q5945231) (← links)
