The Proceedings of Manufacturing Systems Division Conference
Online ISSN : 2424-3108
2004
Session ID : 2101
Conference information
A Sequencing Problem in Mixed-Model Assembly Line with the Aid of Relief Man
Jae Kyu YOOKazuhiko KONOMIRei HINOYoshiaki SHIMIZU
Author information
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Abstract
This paper concerns with a sequencing problem to raise the efficiency of line handling in a mixed-model assembly line where products are assembled in the same cycle time. The goal of the sequencing is to attain two objectives simultaneously, i.e., smoothing of work-load and smoothing of part usage. On real mixed-assembly lines, there exist large variations in the assembly times among different product-models. This causes inefficiency such as line stop or increase in idle time. In this paper, we propose a sequencing method to achieve the above two objectives with the help of Relief Man in such situation. For this purpose, the sequencing problem of minimizing both line stop times and idle times is formulated. Since this problem refers to combinational optimization problems, we develop a hierarchical method that applies meta-heuristics like SA(Simulated Annealing) together with TA(Tabu Search). Finally, we examine effectivness of the proposed method through computer simulations.
Content from these authors
© 2004 The Japan Society of Mechanical Engineers
Previous article Next article
feedback
Top