Browse > Article

Sequencing to Minimize the Total Utility Work in Car Assembly Lines  

현철주 (정인대학 품질관리과)
Publication Information
Journal of the Korea Safety Management & Science / v.5, no.1, 2003 , pp. 69-82 More about this Journal
Abstract
The sequence which minimizes overall utility work in car assembly lines reduces the cycle time, the number of utility workers, and the risk of conveyor stopping. This study suggests mathematical formulation of the sequencing problem to minimize overall utility work, and present a genetic algorithm which can provide a near optimal solution in real time. To apply a genetic algorithm to the sequencing problem in car assembly lines, the representation, selection methods, and genetic parameters are studied. Experiments are carried out to compare selection methods such as roullette wheel selection, tournament selection and ranking selection. Experimental results show that ranking selection method outperforms the others in solution quality, whereas tournament selection provides the best performance in computation time.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Okamura and H. Yamashina, 'A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor', Int. J. Prod. Res., Vol. 17, pp. 233-247, 1979   DOI   ScienceOn
2 P. R. McMullen, 'An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics', Computers & IE, pp. 335-353, 2001
3 T. Tamura, H. Long and K. Ohno, 'A sequencing problem to level part usage rates and work loads for a mixed-model assembly line with a bypass subline', International Journal Of Production Economics, pp. 557-564, 1999
4 J. F. Bard, A. Shtub and S. B. Joshi, 'Sequencing mixed-model assembly lines to level parts usage and minimize line length', Int. J. Prod. Res., Vol. 32, pp, 2431-2454, 1994
5 D. E. Goldberg and K. Deb, 'Comparative Analysis of Selection Schemes Used in Genetic Algorithms', Foundation of Genetic Algorithms, Edited by Gregory J. E., Morgan Kaufmann publishers, pp.69-93, 1991
6 J. Miltenburg and G. Sinnamon, 'Scheduling mixed-model multi-level just-in-time production systems', Int. J. Prod. Res., Vol. 27, pp, 1487-1509, 1989
7 F. Kolahan and M. Liang, 'An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups', Eur. J. Operational Research, pp. 142-159, 1998
8 D. E. Goldberg, B. Korb and K. Deb, 'Messy Genetic Algorithms: Motivation, Analysis, and First Results', Complex Systems, Vol.3, pp.493-530, 1989
9 현철주, '자동차 조립라인에서 부품사용의 일정률 유지를 위한 투입순서 결정', 안전경영과학회지, 4권 3호, pp. 95-105, 2002
10 C. J. Hyun, Y. K. Kim and Y. Kim, 'A Genetic Algorithm for Multiple Objective Sequencing Problems in Mixed Model Assembly Lines', Computers & Ops Res, 25(7-8), pp.675-690, 1998
11 Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Second Editions, Springer-Verlag, 1994
12 D. E. Goldberg, Genetic Algorithms in Search. Optimization. and Machine Learning, Addision-Wesley Publishing Company, 1989
13 R. T. Sumichrast, R. S. Russell and B. W. Taylor III, 'A comparative analysis of sequencing procedures for mixed-model assembly lines in a just-in-time production system', Int. J. Prod. Res. Vol. 30, pp. 199-214, 1992   DOI   ScienceOn
14 Y. K. Kim, C.J. Hyun and Y. Kim, 'Sequencing in Mixed Model Assembly Lines: A Genetic Algorithm Approach', Computers & Ops Res., Vol.23, No. 12, pp. 1131-1145, 1996   DOI   ScienceOn