• Publications
  • Influence
Blood platelet production: Optimization by dynamic programming and simulation
A combined Markov dynamic programming and simulation approach is presented and applied to a real life case of a Dutch blood bank. Expand
  • 168
  • 11
Queueing networks and product forms - a systems approach
  • N. Dijk
  • Computer Science
  • Wiley-Interscience series in systems and…
  • 1993
Practical motivation some fundamental tools station balance - a down-to-Earth approach station balance, a more formal approach station and cluster balance. Expand
  • 131
  • 9
Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks
This chapter presents an approach to compare two Queueing Networks. Expand
  • 19
  • 8
Cost optimal allocation of rail passenger lines
We consider the problem of cost optimal railway line allocation for passenger trains for the Dutch railway system. Expand
  • 155
  • 7
Product forms for queueing networks with state dependent multiple job transitions
A general framework of continuous-time queueing networks is studied with simultaneous state dependent service completions such as due to concurrent servicing or discrete-time slotting and with state dependent batch routings such as most typically modelling blocking. Expand
  • 113
  • 6
Bound Performance Models of Heterogeneous Parallel Processing Systems
Lower and upper bound models are proposed to obtain secure lower and upper bounds on the performance of fork-join models with parallel heterogeneous processors and synchronization. Expand
  • 52
  • 5
  • PDF
On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: existence and approximation
This paper studies the finite horizon Bellman equation for controlled Markov jump models with unbounded jump and cost rates. Under concrete growth conditions on the jump rates a method ofExpand
  • 22
  • 5
Perturbation theory for Markov reward processes with applications to queueing systems
We study the effect of perturbations in the data of a discrete-time Markov reward process on the finite-horizon total expected reward, the infinite-horizon expected discounted and average reward andExpand
  • 66
  • 4
Simple Bounds for Finite Single-Server Exponential Tandem Queues
In this paper, a new bounding methodology for nonproduct form systems is applied to finite single-server exponential tandem queues that provides a computationally attractive and intuitively obvious lower and upper bound for the call congestion and throughput. Expand
  • 51
  • 4
Simple bounds and monotonicity results for finite multi-server exponential tandem queues
  • N. Dijk, J. Wal
  • Mathematics, Computer Science
  • Queueing Syst. Theory Appl.
  • 1 March 1989
Simple and computationally attractive lower and upper bounds are presented for the call congestion such as those representing multi-server loss or delay stations. Expand
  • 59
  • 3
  • PDF