Article ID: | iaor19991698 |
Country: | United Kingdom |
Volume: | 36 |
Issue: | 3 |
Start Page Number: | 815 |
End Page Number: | 836 |
Publication Date: | Mar 1998 |
Journal: | International Journal of Production Research |
Authors: | Agnetis A., Macchiaroli R. |
Keywords: | engineering |
In this paper we consider a manufacturing problem arising in a robotic cell for aircraft panels assembly. An initial technological analysis has shown that some mechanical assembly phases, which involve a huge amount of riveting and screwing operations, can be automated. The motivation of this research is to find the most profitable sequencing of the operations from the viewpoint of throughput time. In particular, we focus on the set-up activities related to switching between operations. The problem is to find the permutation of operations such that the overall switching time is a minimum. In the situation on hand, major precedence constraints among the operations hold. The problem is formulated as an instance of the well-known ‘sequential ordering problem’, for which we propose a tabu search solution heuristic. In this paper we report on both the modelling process and the solution procedures.