Consider a central depot (or plant) which supplies several locations experiencing random demands. Orders are placed (or production is initiated) periodically by the depot. The order arrives after a fixed lead time, and is then allocated among the several locations. (The depot itself does not...

In this paper we discuss stochastic Economic Lot Scheduling Problems (ELSP), i.e., settings where several items need to be produced in a common facility with limited capacity, under significant uncertainty regarding demands, production times, setup times, or combinations thereof. We propose a...

We address multi-item inventory systems with random and seasonally fluctuating, and possibly correlated, demands. The items are produced in two stages, each with its own lead-time; in the first stage a common intermediate product is manufactured. The production volumes in the first stage are...

Stochastic Economic Lot Scheduling Problems (ELSPs) involve settings where several items need to be produced in a common facility with limited capacity, under significant uncertainty regarding demands, unit production times, setup times, or combinations thereof. We consider systems where some...

We characterize supply chain settings in which perfect coordination can be achieved with simple wholesale pricing schemes: either retailer-specific constant unit wholesale prices or retailer-specific volume discount schemes. We confine ourselves to two-echelon supply chains with a single...

We address a fundamental two-echelon distribution system in which the sales volumes of the retailers are endogenously determined on the basis of known demand functions. Specifically, this paper studies a distribution channel where a supplier distributes a single product to retailers, who in turn...

In most dynamic planning problems, one observes that an optimal decision at any given stage depends on limited information, i.e., information pertaining to a limited set of adjacent or nearby stages. This holds in particular for planning problems over time, where an optimal decision in a given...

We develop a model for the competitive interactions in service industries where firms cater to multiple customer classes or market segments with the help of shared service facilities or processes so as to exploit pooling benefits. Different customer classes typically have distinct sensitivities...

We propose and analyze a heuristic that uses region partitioning and an aggregation scheme for customer attributes (load size, time windows, etc.) to create a finite number of customer types. A math program is solved based on these aggregated customer types to generate a feasible solution to the...

This paper is concerned with the general dynamic lot size model, or (generalized) Wagner-Whitin model. Let n denote the number of periods into which the planning horizon is divided. We describe a simple forward algorithm which solves the general model in 0(n log n) time and 0(n) space, as...