Abstract We consider a lot-sizing problem with set-ups where the demands are uncertain, and propose novel approach to evaluate inventory costs. An interval uncertainty is assumed for demands. Between two consecutive production periods, adversary chooses set demand either its higher value or lower in order maximize (holding backlog) A mixed-integer model devised column-and-row generation algorit...

Needless to say that the combined lot sizing and cutting stock problem is very relevant in a wide range of manufacturing industries. This paper presents an algorithmic solution approach to overcome the difficulty in solving non-linear integer formulation of the problem. The algorithm is based on the traditional approach where the lot sizing is determined for each period, and then the best cutti...

Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained wit...

we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model ...

We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...

We study the following lot-sizing models that recently appeared in the literature: a lotsizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing model with cumulative capacities. We show the equivalence of these models with a classical model: the lot-sizing model with inventory bounds.

We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of ...

This paper investigates the integrated optimization of production, distribution and inventory decisions related to supplying multiple retailers from a central production facility. A single-item uncapacitated lot-sizing problem is defined for optimizing production decisions and inventory management. The optimization of daily distribution is modeled as a traveling salesman problem or a vehicle ro...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

We present lot-sizing heuristics that are both e cient and stable for the dynamic lot-sizing problem(DLSP) with constant or variable unit costs, including setup, inventory holding and production costs. These heuristics are myopic variants of the forward Wagner-Whitin algorithm with rolling horizons. Large scale computational experiments show that these heuristics considerably outperform other w...