Modeling complex systems, including discrete event systems, remains a challenge. The complexity and the size of such systems prevent understanding their models. This article proposes an approach for reducing queuing networks large models into smaller ones. The objective is to reduce the analysis...

We study how rework routing together with wage and piece rate compensation can strengthen incentives for quality. Traditionally, rework is assigned back to the agent who generates the defect (in a self routing scheme) or to another agent dedicated to rework (in a dedicated routing scheme). In...

Techniques for performance estimation in parallel database systems are well established for parameters such as throughput, bottlenecks and resource utilisation. However, response time estimation is a complex activity which is difficult to predict and has attracted research for a number of years....

In recent years, the performance-based approach to contracting for medical services has been gaining popu-larity across different healthcare delivery systems, both in the US (under the name of "Pay-for-Performance",or P4P), and abroad ("Payment-by-Results", or PbR, in the UK). One common element...

A set of agents with possibly different waiting costs have to receive the same service one after theother. Efficiency requires to maximize total welfare. Equity requires to at least treat equal agentsequally. One must form a queue, set up monetary transfers to compensate agents having to...

In this paper, we present a bounding methodology that allows to compute a tight lower boundon the cycle time of fork--join queueing networks with blocking and with general service timedistributions. The methodology relies on two ideas. First, probability masses fitting (PMF)discretizes the...