We study a two-echelon supply chain consisting of a supplier and a retailer, where the supplier uses a simple and easily implementable incentive scheme - making a side payment - to influence the retailer's ordering plan. The supplier makes a take-it-or-leave-it offer to the retailer in the form...

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

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 adeterministic function of price. In the model a single price need to be set for all periods. Theobjective is to find an optimal price and ordering decisions simultaneously. In 1973 Kunreuther and Schrage...

In designing coordination contracts, the conflict between theory and practice often appears in the form of a trade-off between the complexity of theoretically optimal solutions and their ease of implementation in the real world. In this study, we explicitly consider complexity as a design factor...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including 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...