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...