The online platform for Taylor & Francis Group content

Cookies Notification

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies. Find out more.

Advanced and citation search

IIE Transactions

LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS

Preview Download full text

Access options

DOI:: 10.1080/07408179308964266

ROELOF KUIK^a, MARC SALOMON^a, LUK N. VAN WASSENHOVE^b & JOHAN MAES^c

pages 62-72

Publishing models and article dates explained

Received: 1 Dec 1989
Published online: 13 Jul 2010

Article Views: 35

Article usage statistics combine cumulative total PDF downloads and full-text HTML views from publication date (but no earlier than 25 Jun 2011, launch date of this website) to 29 Apr 2015. Article views are only counted from this site. Although these data are updated every 24 hours, there may be a 48-hour delay before the most recent numbers are available.

New content email alert | Citation email alert

Alert me

Abstract

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.