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

We study the location-inventory problem in three-level supply networks. Our model integrates three decisions: the distribution centers location, flows allocation, and shipment sizes. We propose a nonlinear continuous formulation, including transportation, fixed, handling and holding costs, which...