We study Taylor series expansions of stationary characteristics of general-state-space
Markov chains. The elements of the Taylor series are explicitly calculated and a lower bound …

This chapter addresses analyticity of performance measures, say J (^), such as completion
times, waiting times or the throughput (that is, the inverse Lyapunov exponent), of max-plus …

We consider a stationary waiting time in a Poisson driven single-server m-node tandem
queue with either constant or non-overlapping service times. Each node except for the first …

We conduct exact analysis of serial production lines with deterministic service durations and
various classes of random state-dependent setups between customers. Our focus is on …

We compared three types of WIP-controlled line production systems with constant
processing times such as Kanban, CONWIP (constant work-in-process) and DBR (drum …

(Max,+) linear systems can be used to represent a class of queueing networks, such as
acyclic or cyclic fork-and-join queueing networks, finite-or infinite-capacity tandem queueing …

Tandem queues with a finite buffer capacity are the common structures embedded in
practical production systems. We study the properties of tandem queues with a finite buffer …

Even though many computational methods (recursive formulae) for blocking probabilities in
finite‐capacity M/D/1 queues have already been produced, these are forms of transforms or …

While flow line models have been studied for decades, excepting some cases with three
servers or less, their equilibrium probabilities remain elusive. As such, approximations …

In a fork-join network each incoming job is split into K tasks and the K tasks are
simultaneously assigned to K parallel service stations for processing. For the distributions of …