Many problems in manufacturing systems can be formulated via Markov stochastic
modeling. This paper gives a review and classification of timed models of manufacturing …

Full of practical examples, Introduction to Scheduling presents the basic concepts and
methods, fundamental results, and recent developments of scheduling theory. With …

We propose to perform statistical probabilistic model checking by using perfect simulation in
order to verify steady-state and time unbounded until formulas over Markov chains. The …

Perfect simulation, or coupling from the past, is an efficient technique for sampling the steady
state of monotone discrete time Markov chains. Indeed, one only needs to consider two …

The solution of continuous and discrete-time Markovian models is still challenging mainly
when we model large complex systems, for example, to obtain performance indexes of …

Markovian networks of finite capacity queues are widely used models for performance
evaluation of systems and networks. Unfortunately, excepted in some specific situations …

We present a new version of the time-parallel simulation with fix-up computations for
monotone systems. We use the concept of monotony of a model related to the initial state of …

This study conducts a quantitative research survey on the development of queueing
networks over years. Development is a process of gradual change that takes place over …

We show how we can make more efficient the time parallel simulation of some queueing
networks. We had previously introduced some improvements of two classical time parallel …

In this chapter, we show how to compare the performance of stochastic task resource
systems. Here, task resource systems are modeled by dynamic systems whose inputs are …