Abstract In a single item dynamic lot-sizing problem, we are given time horizon and demand for in every period. The problem seeks solution that determines how much to produce carry at each period, so will incur the least amount of production inventory cost. When remanufacturing option is included, input comprises number returned products period can be potentially remanufactured satisfy demands,...

In this paper we extend the generalized surrogate optimization approaches and the stochastic comparison so as to tackle the lot-sizing problem in manufacturing system. In practice, with the surrogate methodology, the lot sizes are continuously adjusted on-line by the gradient-based approaches. The lot sizing determines the number of parts batched together for production. We utilize the queueing...

For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,SQ) inequalities can be simplified and extended. Finally some limited computational results are presented.

Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied

A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Using this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm als...

With the growing focus on supply chain management, firms realize that inventories across the entire supply chain can be more efficiently managed through greater cooperation and better coordination. This paper presents a comprehensive and up-to-date review of the joint economic lot sizing problem (JELP) and also provides some extensions of this important problem. In particular, a detailed mathem...

A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...

Often lot sizing and scheduling models have neglected the consideration of influence of product life cycles (PLCs). But, accordingly as desirable in a firm’s production strategy, decisions of lot sizing scheduling may have to respond to the stage changes in a product’s life cycle. In this paper, we propose an extension of the lot sizing scheduling, the multi-item, multi-level product-structure...