대한안전경영과학회지 (Journal of the Korea Safety Management & Science)

  • 제5권1호
  • /
  • Pages.69-82
  • /
  • 2003
  • /
  • 1229-6783(pISSN)
  • /
  • 2288-1484(eISSN)
대한안전경영과학회 (Korea Safety Management & Science)
권호 표지

자동차 조립라인에서 총 가외작업을 최소로 하는 투입순서 결정

Sequencing to Minimize the Total Utility Work in Car Assembly Lines

  • 발행 : 2003.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. 현철주, '자동차 조립라인에서 부품사용의 일정률 유지를 위한 투입순서 결정', 안전경영과학회지, 4권 3호, pp. 95-105, 2002
  2. 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
  3. D. E. Goldberg, Genetic Algorithms in Search. Optimization. and Machine Learning, Addision-Wesley Publishing Company, 1989
  4. D. E. Goldberg, B. Korb and K. Deb, 'Messy Genetic Algorithms: Motivation, Analysis, and First Results', Complex Systems, Vol.3, pp.493-530, 1989
  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. 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
  7. 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
  8. 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
  9. 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 https://doi.org/10.1080/00207547908919611
  10. P. R. McMullen, 'An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics', Computers & IE, pp. 335-353, 2001
  11. 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 https://doi.org/10.1080/00207549208942887
  12. 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
  13. 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 https://doi.org/10.1016/S0305-0548(96)00033-0
  14. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Second Editions, Springer-Verlag, 1994