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

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 system 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 wen 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.