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

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

In this paper, we consider a continuous review inventory system of a slow moving item for which the demand rate drops to a lower level at a pre-determined time. Inventory system is controlled according to one-for-one replenishment policy with fixed lead time. Adaptation to the lower demand rate...

In the warehouse of Ankor, a wholesaler of tools and garden equipment, various problems concerning the storage and retrieval of products arise. For example, heavy products have to be retrieved prior to light products to prevent damage. Furthermore, the layout of the warehouse differs from the...

In this paper we deal with a common problem found in the operations of security and preventive/corrective maintenance services: that of routing a number of mobile resources to serve foreseen and unforeseen tasks during a shift. We define the (Mobile Re-Allocation Problem) MRAP as the problem of...

Real-time railway operations are subject to stochastic disturbances. However, a railway timetable is a deterministic plan. Thus a timetable should be designed in such a way that it can absorb the stochastic disturbances as well as possible. To that end, a timetable contains buffer times between...

Reliability is one of the key factors in transportation, both for passengers and for cargo. This paper examines reliability in public railway systems. Reliability of railway services is a complex matter, since there are many causes for disruptions and at least as many causes for delays to spread...