Article ID: | iaor19991751 |
Country: | Netherlands |
Volume: | 100 |
Issue: | 3 |
Start Page Number: | 399 |
End Page Number: | 412 |
Publication Date: | Aug 1997 |
Journal: | European Journal of Operational Research |
Authors: | Kok Ton G. de, Zante-de Fokkert Jannet I. van |
Keywords: | programming: branch and bound |
The balancing problem deals with the assignment of tasks to work stations. We can distinguish two approaches in the literature on the mixed model line balancing problem, that both transform this problem into a single model line balancing problem. These approaches use combined precedence diagrams and adjusted task processing times, respectively. An experiment was carried out to compare several heuristics based on the combined precedence diagram. A new optimisation method has been developed. The results indicate that the position of common tasks in the precedence diagram of the different models has a significant effect on both the CPU time and the unequal distribution of the total work content of single models among work stations. Moreover, good solutions with respect to the number of required stations go together with long CPU times. For several instances, we decreased the CPU times considerably without deteriorating the performance of the methods, by using a reversed combined precedence diagram.