Normal view MARC view

Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems

Author: Van Wassenhove, Luk N. ; Salomon, Marc ; Kuik, Roelof ; Maes, JohanINSEAD Area: Technology and Operations ManagementIn: IIE Transactions, vol. 26, no. 2, jan. 1993 Language: EnglishDescription: p. 12-18.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: Multilevel lotsizing is one of the most challenging subjects in production planning, especially in the presence of capacity constraints. In this paper we investigate lotsizing heuristics for assembly production systems with a bottleneck. More specifically, we discuss heuristics based on linear programming (LP), and compare the performance of these heuristics with the performance of approaches based on simulated annealing and tabu search techniques. A comparison of the three heuristics on a set of test problems shows that simulated annealing and tabu search perform well compared to pure LP-based heuristics, but the effectiveness of the latter heuristics can be improved by combining them with elements from simulated annealing and tabu search
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

Multilevel lotsizing is one of the most challenging subjects in production planning, especially in the presence of capacity constraints. In this paper we investigate lotsizing heuristics for assembly production systems with a bottleneck. More specifically, we discuss heuristics based on linear programming (LP), and compare the performance of these heuristics with the performance of approaches based on simulated annealing and tabu search techniques. A comparison of the three heuristics on a set of test problems shows that simulated annealing and tabu search perform well compared to pure LP-based heuristics, but the effectiveness of the latter heuristics can be improved by combining them with elements from simulated annealing and tabu search

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?