__Abstract__ Providing African truck drivers with adequate access to healthcare is an effective way to reduce the burden and the spread of HIV and other infectious diseases. Therefore, NGO North Star Alliance builds a network of healthcare facilities along major African trucking routes. Choosing...

This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogging is allowed. For general concave production and inventory costs, we present an O(T2) dynamic programming algorithm where T is the length of the planning horizon. Furthermore, for fixed-charge...

In this paper we introduce a new class of OR games: economic lot-sizing (ELS) games. There are a number of retailers that have a known demand for a fixed number of periods. To satisfy demand the retailers order products at the same manufacturer. By placing joint orders instead of individual...

We address the dynamic lot sizing problem for systems with product returns. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured/procured new items, but also by remanufactured returned items. The objective is to determine...

In a recent paper Gutierrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.

In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items....

In a recent paper, Fisher et al. (2001) present a method to mitigate end-effects in lot sizing byincluding a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...

In this paper we consider the capacitated lot-sizing problem (CLSP) with linear costs. It is known that this problem is NP-hard, but there exist special cases that can be solved in polynomial time. We derive a backward algorithm, based on the forward algorithm by Chen et al. (1994), to solve the...

In this note we present an efficient exact algorithm to solve the joint pricing and inventory problem for which Bhattacharjee and Ramesh (2000) proposed two heuristics. Our algorithm appears to be superior also in terms of computation time. Furthermore, we point out several mistakes in the paper...

In this paper we consider the uncapacitated economic lot-size model, where demand is a deterministic function of price. In the model a single price need to be set for all periods. The objective is to find an optimal price and ordering decisions simultaneously. In 1973 Kunreuther and Schrage...