Showing 1 - 10 of 614
Persistent link: https://www.econbiz.de/10001651798
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the...
Persistent link: https://www.econbiz.de/10010302558
This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is...
Persistent link: https://www.econbiz.de/10010302566
Persistent link: https://www.econbiz.de/10010306018
We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...
Persistent link: https://www.econbiz.de/10010324804
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...
Persistent link: https://www.econbiz.de/10010324957
This contribution presents an efficient solution method for solving the major short-term planning problems which occur, if lot production has to be managed. In our focus are the two most important aspects, i.e. lot sizing and scheduling. Since both problems heavily interact, we propose an...
Persistent link: https://www.econbiz.de/10011558736
This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized...
Persistent link: https://www.econbiz.de/10010264943
This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production...
Persistent link: https://www.econbiz.de/10010264947