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

This paper focuses on an industrial lot-sizing and scheduling problem that arises in the food industry includes lost sales, overtimes sequence-dependent setups parallel machines. We propose a preliminary version of three-phase iterative approach to optimize separately affectation, sequencing production items. Our first numerical results suggest with some additional improvements, this could be u...

An important special case of the economic lot-sizing problem is the one in which there are no speculative motives to hold inventory, i. e., the marginal cost of ]n'oducing one unit m some period plus the cost of holding it until some future period is at least the marginal production cost in the latter period. It is already known that this special case can be solved in linear time. In this paper...

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...