We consider the economic lot-sizing problem with perishable items (ELS-PI), where each item has a deterministic expiration date. Although all items in stock are equivalent regardless of procurement or expiration date, we allow for an allocation mechanism that defines an order in which the items...

We consider a firm that markets, procures, and delivers a good with a single selling season in a number of different markets. The price for the good is market-dependent, and each market has an associated demand distribution, with parameters that depend on the amount of marketing effort applied....

This paper develops effective solution methods for discrete-time, finite-horizon procurement planning problems with economies of scale in procurement, price-sensitive demand, and time-invariant procurement capacities. Our models consider general concave-revenue functions in each time period, and...

We study a class of capacity acquisition and assignment problems with stochastic customer demands often found in operations planning contexts. In this setting, a supplier utilizes a set of distinct facilities to satisfy the demands of different customers or markets. Our model simultaneously...

We consider a generalisation of the lot-sizing problem that includes an emission capacity constraint. Besides the usual financial costs, there are emissions associated with production, keeping inventory and setting up the production process. Because the capacity constraint on the emissions can...

In a recent paper Gutièrrez et al. [1] show that the lot-sizing problem with inventory bounds can be solved in time. In this note we show that their algorithm does not lead to an optimal solution in general.

In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an...