JSME International Journal Series C Mechanical Systems, Machine Elements and Manufacturing
Online ISSN : 1347-538X
Print ISSN : 1344-7653
ISSN-L : 1344-7653
PAPERS
A Sequencing Problem for Mixed-Model Assembly Line with the Aid of Relief-Man
Jae Kyu YOOYoshiaki SHIMIZURei HINO
Author information
JOURNAL FREE ACCESS

2005 Volume 48 Issue 1 Pages 15-20

Details
Abstract
There usually exist large variations in assembly times at mixed-model assembly lines depending on difference of product-models. To increase efficiency of line handling under such circumstance, this paper concerns with a sequencing problem for the mixed-model assembly lines where each product is supposed to be assembled within the same cycle time. Then, we formulate a new type of the sequencing problem minimizing the weighted sum of the line stoppage times and the idle times, and propose a new sequencing method with the aid of Relief Man (RM). Since the resulting problem refers to a combinational optimization problem, we develop a hybrid method that applies meta-heuristics like SA (Simulated Annealing) together with TS (Tabu Search) in a hierarchical manner. Finally, we examine the effectiveness of the proposed method through computer simulations and show the advantage of using RM against various changes in production environment.
Content from these authors
© 2005 by The Japan Society of Mechanical Engineers
Previous article Next article
feedback
Top