Statistical search methods for lotsizing problems
Author: Van Wassenhove, Luk N. ; Salomon, Marc ; Kuik, RoelofINSEAD Area: Technology and Operations Management Series: Working Paper ; 92/09/TM Publisher: Fontainebleau : INSEAD, 1992.Language: EnglishDescription: 14 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: The main objective of lotsizing is to generate a minimum cost production and inventory schedule, such that customer demand is satisfied, and capacity restrictions imposed on production resources are not violated. This paper discusses the author's experiences in solving these, in general NP-hard, lotsizing problems with popular statistical search techniques such simulated annealing and tabu search. The paper concludes with some critical remarks on the use of statistical search methods for solving lotsizing problems| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC000930 |
The main objective of lotsizing is to generate a minimum cost production and inventory schedule, such that customer demand is satisfied, and capacity restrictions imposed on production resources are not violated. This paper discusses the author's experiences in solving these, in general NP-hard, lotsizing problems with popular statistical search techniques such simulated annealing and tabu search. The paper concludes with some critical remarks on the use of statistical search methods for solving lotsizing problems
Digitized
There are no comments for this item.