Minimizing Total Flow Time for Multiple Parts and Assembly Flow Shop

복수의 부품 및 조립 흐름공정의 총흐름시간 최소화

  • Moon, Gee-Ju (Dept. of Industrial and Management Systems Engineering, Dong-A University) ;
  • Lee, Jae-Wook (Dept. of Industrial and Management Systems Engineering, Dong-A University)
  • 문기주 (동아대학교 산업경영공학과) ;
  • 이재욱 (동아대학교 산업경영공학과)
  • Received : 2011.10.10
  • Accepted : 2011.10.21
  • Published : 2011.12.31

Abstract

A typical job sequencing problem is studied in this research to improve productivities in manufacturing companies. The problem consists of two-stage parts and assembly processes. Two parts are provided independently each other and then two sequential assembly processes are followed. A new heuristic is developed to solve the new type of sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. In the first stage, a longer part manufacturing time for each job is selected between two, and then a sequence is determined by descending order of the times. This initial sequence is compared with Johnson's sequence obtained from 2-machine assembly times. Any mismatches are tried to switch as one possible alternative and completion time is calculated to determine whether to accept the new sequence or not to replace the current sequence. Searching process stops if no more improvement can be made.

Keywords

References

  1. 문기주 옮김, Dileep R. Sule; "일정계획이론", 시그마 프레스, 2002.
  2. 윤상흠, 전재호; "부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선", Journal of the Society of Korea Industrial and Systems Engineering, 31(2) : 80-93, 2008.
  3. 이익선, 윤상흠, 하귀룡, 전재호; "부품 생산과 조립으로 구성된 2단계 조립 일정계획의 Flowtime 최소화 연구", Journal of the Society of Korea Industrial and Systems Engineering, 33(4) : 45-57, 2010.
  4. 전재호; "부품외주를 고려한 조립형 Flowshop 일정계획문제 연구", Journal of the Society of Korea Industrial and Systems Engineering, 29(4) : 34-42, 2006.
  5. Hariri, A. M. A. and Potts, C. N.; "A branch and bound algorithm for the two-stage assembly scheduling problem," European Journal of Operational Research, 103 : 547-556, 1997. https://doi.org/10.1016/S0377-2217(96)00312-8
  6. Juhn, J., Sung, C. S., and Yoon, S. H.; "Analysis of heuristics for a two-stage assembly scheduling problem with component available time constraint," Submitted to Operations Research Letters for publication, 2006.
  7. Kovalyov, M. Y., Potts, C. N., and Strusevich, V. A.; "Batching decisions for assembly production systems," European Journal of Operational Research, 157 : 620-642, 2004. https://doi.org/10.1016/S0377-2217(03)00250-9
  8. Lee, C. Y., Cheng, T. C. E., and Lin, B. M. T.; "Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem," Management Science, 39 : 616-625, 1993. https://doi.org/10.1287/mnsc.39.5.616
  9. Lin, B. M. T., Cheng, T. C. E., and Chou, A. S. C.; "Scheduling in an assembly-type production chain with batch transfer," OMEGA : The International Journal of Management Science, 35(2) : 143-151, 2007. https://doi.org/10.1016/j.omega.2005.04.004
  10. Potts, C. N., Sevas'janov, S. V., Strusevich, V. A., Wassenhove, L. N. V., and Zwaneveld, C. M.; "The two-stage assembly scheduling problem : Complexity and approximation," Operation Research, 43 : 346-355, 1995. https://doi.org/10.1287/opre.43.2.346
  11. Sun, X., Morizawa, K., and Nagasawa, H.; "Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling," European Journal of Operational Research, 146 : 498-516, 2003. https://doi.org/10.1016/S0377-2217(02)00245-X