Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Optimal Conveyor Selection Problem on a Diverging Conveyor Junction Point

컨베이어 분기점에서의 최적 인출 컨베이어 선택 문제

  • Published : 2009.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

Keywords

References

  1. 김경태; “공장 자동화 시스템의 컴퓨터 시뮬레이션 분석에 관한 연구”, 석사 학위 논문, 중앙대학교 : 10-27, 1992
  2. 김원경, 김충규; “자동차 도장공정의 생산성 향상을 위한 시뮬레이션 분석”, 한국시뮬레이션학회 논문지, 8(2) : 1999
  3. 문덕희, 송 성, 하재훈; “자동차 공장에서 CRS와 PBS의 전용레인 설치에 관한 시뮬레이션 연구”, 한국시뮬레이션학회 2004 춘계학술대회 논문집 : 77-82, 2004
  4. 문덕희, 김하석, 송 성, 김경완; “자동차 도장공장의 Color Rescheduling Storage 설치를 위한 시뮬레이션 분석”, IE Interfaces, 16(2) : 211-221, 2003
  5. 박혜규, 최원준, 신현오; “자동차 도장공장의 Color Selection 시스템의 자동화”, 산업공학, 9(2) : 19-37, 1996
  6. 정은도; “도장실무 핸드북”, 일진사 : 11, 1990
  7. 최원준 외; “도장부스가 2개인 자동차 조립 공장의 생산순서 계획 작성”, 한국 경영과학회/한국 산업공학회 '97 춘계 공동학술대회 논문집 : 451-454, 1997
  8. Ascheuer, N.; "Hamiltonian path problems in the on-line optimization of flexible manufacturing systems (Ph. D. Thesis)," Technology University of Berlin, 1995
  9. Atassi, F. R.; "Implementation of block painting in Ford's in-line vehicle sequencing environment (MS Thesis)," in System Design and Management Program Cambridge : MIT, 1996
  10. Bonsma, P.; "Complexity results on restricted instances of a paint shot problem for words," Discrete Applied Mathematics, 154 : 1335-1343, 2006 https://doi.org/10.1016/j.dam.2005.05.033
  11. Campos, M., Bonabeau, E., Theraulaz, G., and Deneubourg, J.; "Dynamic scheduling and division of labor in social insects," Adaptive Behavior, 8 : 83-92, 2001 https://doi.org/10.1177/105971230000800201
  12. Choe, K. I., Sharp, G. P., and Serfozo, R. S.; "Aisle-based order pick systems with batching, zoning, and sorting," in Progress in Material Handling Research, 1993
  13. Daganzo, C. F.; "Static blocking at railyards : Sorting implications and track requirements," Transportation Science, 20 : 189-199, 1986 https://doi.org/10.1287/trsc.20.3.189
  14. Escudero, L.; "An inexact algorithm for the sequential ordering problem," European Journal of Operational Research, 37 : 236-253, 1988 https://doi.org/10.1016/0377-2217(88)90333-5
  15. Farber, G. and Coves, A.; "Overview on sequencing in mixed model flowshop production line with static and dynamic context," Internal report IOC-DT-P-2005-7, Universitat Politecnica de Catalunya, 2005
  16. Gambardella, L. and Dorigo, M.; "An ant colony system hybridized with a new local search for the sequential ordering problem," INFORMS Journal on Computing, 12 : 237-255, 2000 https://doi.org/10.1287/ijoc.12.3.237.12636
  17. Han, Y.; "Dynamic sequencing of jobs on conveyor systems for minimizing changeovers (Ph. D. Thesis)," in School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004
  18. Jeong, M. K., Perry, M., and Zhou, C.; "Throughput Gain with Parallel Flow in Automated Flow Lines," IEEE Transactions on Automation Science and Engineering, 2 : 84-86, 2005 https://doi.org/10.1109/TASE.2004.829348
  19. Kittithreerapronchai, O. and Anderson, C.; "Do ants paint trucks better than chickens? Market versus response thresholds for distributed dynamic scheduling," in Proceedings of the 2003 IEEE Congress on Evolutionary Computation, Canberra, Australia, 2003 https://doi.org/10.1109/CEC.2003.1299839
  20. Lahmar, M. and Benjaafar, S.; "Sequencing with limited flexibility," IIE Transactions, 39 : 937-955, 2007 https://doi.org/10.1080/07408170701416665
  21. Lim, A. and Xu, Z.; "Searching optimal resequencing and feature assignment on an automated assembly line," Journal of the Operational Research Society, 60(3) : 361-371, 2009 https://doi.org/10.1057/palgrave.jors.2602533
  22. Morley, R.; "Painting trucks at General Motors : The effectiveness of a complexity-based approach," The Ernst and Young Center for Business Innovation, Cambridge, 1996
  23. Morley, R. and Ekberg, G.; "Cases in chaos: Complexity-based approaches to manufacturing," The Ernst and Young Center for Business Innovation, Cambridge 1998
  24. Morley, R. and Schelberg, C.; "An analysis of a plant-specific dynamic scheduler," in Final Report, Intelligent, Dynamic Scheduling for Manufacturing Systems: 115-122, 1993
  25. Myron, D. L.; "Paint blocking in Ford's in-line vehicle sequencing environment(MS Thesis)," in Leaders for Manufacturing Program Cambridge: MIT, 1996
  26. Siddiqee, M. W.; "Investigation of Sorting and Train Formation Schemes for a Railroad Hump Yard," in Traffic Flow and Transportation, G. F. Newell, Ed. New York: Elsevier: 377-387, 1972
  27. Spieckermann, S., Gutenschwager, K., and Voss, S.; "A sequential ordering problem in automotive paint shops," International Journal of Production Research, 42 : 1865-1878, 2004 https://doi.org/10.1080/00207540310001646821
  28. Yagar, S., Saccomanno, F. F., and Shi, Q.; "An efficient sequencing model for humping in a rail yard," Transportation Research, 17A : 251-262, 1983 https://doi.org/10.1016/0191-2607(83)90089-4