Normal view MARC view

Statistical search methods for lotsizing problems

Author: Van Wassenhove, Luk N. ; Salomon, Marc ; Kuik, RoelofINSEAD Area: Technology and Operations ManagementIn: Annals of Operations Research, vol. 41, 1993 Language: EnglishDescription: p. 453-468.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: This paper reports on the author's experiments with statistical search methods for solving lotsizing problems in production planning. In lotsizing problems the main objective 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 as simulated annealing and tabu search. The paper concludes with some critical remarks on the use of statistical search methods for solving lotsizing problems
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Call number Status Date due
INSEAD Article Doriot Library
Available

Please ask the Library for this article

This paper reports on the author's experiments with statistical search methods for solving lotsizing problems in production planning. In lotsizing problems the main objective 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 as 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.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?