In a recent paper, Liu (2008) considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains th...

Previous work has studied the classical joint economic lot size model as an adverse selection problem with asymmetric cost information. Solving this problem is challenging due to the presence of countervailing incentives and two-dimensional information asymmetry, under which the classical single-crossing condition does not need to hold. In the present work we advance the existing knowledge abou...

In this paper we derive a new structural property for an optimal solution of the economic lot-sizing problem with time-invariant cost parameters. We show that the total holding cost in an order interval of an optimal solution is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. Since we can also show that this bound is ti...

We consider a new class of cooperative cost sharing games, associated with the economic lot-sizing problem with remanufacturing options (ELSR). As a preliminary step, we investigate the relative strength and integrality gaps of various mathematical optimization formulations of ELSR. Using insights from these results, we study the core of the associated cost sharing game. We show that the cost s...

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...