We consider the problem of shipping several products from an origin to a destination when a discrete set of shipping frequencies is available, in such a way that the sum of the transportation and inventory costs is minimized. This problem, which is known to be NP-hard, has applications in...

We consider the problem in which several products have to be shipped from a supplier to a set of retailers over an infinite time horizon. Each product is made available at the supplier and absorbed by each retailer at given constant production and consumption rates. For each product, the unit...

We study the problem of determining the optimal dimension of a work-in-process storage area in a two-line production system with delays and breakdowns. We propose a stochastic model and prove theoretical results that allow us to implement an exact algorithm for the solution of the model. We...

The classical objective function of the Vehicle Routing Problem (VRP) is to minimize the total distance traveled by all vehicles (Min–Sum). In several situations, such as disaster relief efforts, computer networks, and workload balance, the minimization of the longest route (Min–Max) is a...

In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period...

We study a logistic system in which a supplier has to deliver a set of products to a set of retailers to face a stochastic demand over a given time horizon. The transportation from the supplier to each retailer can be performed either directly, by expensive and fast vehicles, or through an...