Article ID: | iaor2002144 |
Country: | Netherlands |
Volume: | 131 |
Issue: | 3 |
Start Page Number: | 611 |
End Page Number: | 621 |
Publication Date: | Jun 2001 |
Journal: | European Journal of Operational Research |
Authors: | Gemmill Douglas D., Lee Hyoung-Ro |
Keywords: | optimization: simulated annealing, programming: branch and bound |
The assembly sequence is determined using product unit cost as the performance measure. The global optimum for a given problem is found by partially enumerating assembly station configurations with branch and bound methods. The study shows that the proposed methods perform faster than simulated annealing for the example problems used. It is shown that the unit cost function is not necessarily convex, which was assumed in previous research.