Article ID: | iaor20002076 |
Country: | Netherlands |
Volume: | 4 |
Issue: | 4 |
Start Page Number: | 359 |
End Page Number: | 381 |
Publication Date: | Dec 1998 |
Journal: | Journal of Heuristics |
Authors: | Domschke W., Scholl A., Klein R. |
In this paper, the problem of sequencing mixed-model assembly lines in case of fixed rate launching and closed stations is considered. The problem consists of finding an intermixed sequence of different models of a basic product, which are jointly produced on an assembly line, such that customer demands are fulfilled and total work overload is minimized. For solving this problem an informed tabu search procedure with a pattern based vocabulary building strategy is developed. Computational tests demonstrate that considerable improvements are obtained by comparison to methods which do not incorporate such an approach.