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. The purpose of this paper is twofold. First, we derive a backward algorithm based on the forward...

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 analyse the effect of satisfying in a different way customers with an order larger than a prespecified cutoff transaction size, in a simple newsboy setting. For compound Poisson demand with discrete order sizes, we show how to determine the expected costs and the optimal cutoff...

In this chapter we discuss a tactical optimisation problem that arises in a multistage distribution system where customer orders can be delivered from any stockpoint. A simple rule to allocate orders to locations is a break quantity rule, which routes large orders to higher-stage stockpoints and...

In this paper the effect of the break quantity rule on the inventory costs in a 1-warehouse, N-retailers distribution system is analyzed. The break quantity rule is to deliver large orders from the warehouse, and small orders from the nearest retailer, where a so--called break quantity...

During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumerative approach and was computationally prohibitive. In this paper we present an alternative optimal...

In multi-echelon distribution systems it is usually assumed that demand is only satisfied from the lowest echelon. In this paper we will consider the case where demand can be satisfied from any level in the system. However, then the problem arises of how to allocate orders from customers to the...

In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and...