The past decade has seen a virtual explosion of information about customers and their preferences. This information potentially allows companies to increase their revenues, in particular since modern technology enables price changes to be effected at minimal cost. At the same time, companies...

We analyze a newsboy problem with resalable returns. A single order is placed before the selling season starts. Purchased products may be returned by the customer for a full refund within a certain time interval. Returned products are resalable, provided they arrive back before the end of the...

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

The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex...

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