DOI QR코드

DOI QR Code

Integer Programming-based Operation Sequencing for Multi-operation on Single Machine

정수계획법을 통한 다중작업 수행 단일기계에서의 작업순서 결정

  • Park, Seonyeong (Department of Industrial and Management Engineering, Hanbat National University) ;
  • Shin, Moonsoo (Department of Industrial and Management Engineering, Hanbat National University)
  • Received : 2018.12.12
  • Accepted : 2019.02.25
  • Published : 2019.03.31

Abstract

With the advent of the Fourth Industrial Revolution, multi-variety production in the up-to-date manufacturing environment is proceeding more rapidly whereby production planning and management have been getting more complicated. Moreover, the need to improve production efficiency through effective operation sequencing is further heightened. Fundamentally, the effective operation sequencing can reduce the set-up of the equipment, efficiently utilize the equipment, shorten the set-up time, and ultimately contribute to productivity improvement. This study deals with the problem of efficient operation sequencing in a situation where a single machine performs multiple operations. The complexity of the problem is very high when compared to the case where only one operation is performed on one machine, which is covered in most existing studies. In this paper, we propose an integer programming model to minimize the number of setups. This study aims at minimizing the number of mold replacement times in the process of processing a given production order for the wiring harness manufacturing process, which is one of the components of automobile electric field. In addition, brief case studies are presented to verify the validity of the proposed mathematical model.

4차 산업혁명의 도래와 함께 제조 환경의 다품종화가 더욱 급격히 진행되고 있다. 다품종화된 생산 환경은 전반적인 생산계획 및 관리를 더욱 어렵게 하고 있으며, 효과적인 작업순서 결정을 통한 생산 효율 제고의 필요성을 더욱 높이고 있다. 기본적으로 효과적인 작업순서는 설비의 셋업을 감소시키고 설비의 효율적 활용과 함께 셋업 시간 단축을 도모하여 궁극적으로는 생산성 향상에 기여할 수 있다. 본 연구는 단일 기계가 다중 작업을 수행하는 상황에서의 효율적인 작업순서 결정 문제를 다룬다. 이는 대부분의 기존 연구에서 다루고 있는 한 대의 기계에서 하나의 작업만을 수행하는 경우와 비교할 때 문제의 복잡성이 매우 높다. 본 연구에서는 특히 셋업 횟수를 최소화하기 위한 정수계획 모형을 제안한다. 이는 자동차 전장 구성품의 하나인 와이어링 하네스 제조 공정을 대상으로 주어진 생산주문을 처리하는 과정에 금형 교체횟수를 최소화하는 문제를 대상으로 한다. 또한 제안된 수리 모형의 유효성을 검증하기 위해 간단한 사례연구 결과를 함께 제시한다.

Keywords

References

  1. A. A. Chaves, L. A. N. Lorena, E. L. F. Senne and M. G. Resende, Hybrid Method with CS and BRKGA Applied to the Minimization of Tool Switches Problem. Computers & Operations Research. (2016), Vol.67, pp.174-183. https://doi.org/10.1016/j.cor.2015.10.009
  2. M. P. Groover, Automation, Production Systems and Computer-integrated Manufacturing, Pearson Education India. (2016)
  3. D. H. Lee, D. Kiritsis and P. Xirouchakis, Branch and Fathoming Algorithms for Operation Sequencing in Process Planning. International Journal of Production Research. (2001), Vol.39, No.8, pp.1649-1669. https://doi.org/10.1080/00207540010028100
  4. C. Moon, M, Lee, Y. Seo and Y. H. Lee, Integrated Machine Tool Selection and Operation Sequencing with Capacity and Precedence Constraints Using Genetic Algorithm. Computers & industrial engineering. (2002), Vol.43, No.3, pp.605-621. https://doi.org/10.1016/S0360-8352(02)00129-8
  5. D. H. Lee, D. Kiritsis and P. Xirouchakis, Search Heuristics for Operation Sequencing in Process Planning. International journal of production research. (2001), Vol.39, No.16, pp.3771-3788. https://doi.org/10.1080/00207540110061922
  6. E. G. Singh and A. Singh, Operation Sequencing Using Genetic Algorithm. International Journal of Emerging Trends in Engineering and Development. (2012), Vol.5, No.2, pp.863-867.
  7. J. F. Bard, A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine. IIE Transactions. (1988), Vol.20, No.4, pp.382-391. https://doi.org/10.1080/07408178808966195
  8. C. S. Tang and E. V. Denardo, Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches. Operations research. (1988), Vol.36, No.5, pp.767-777. https://doi.org/10.1287/opre.36.5.767
  9. C. S. Tang and E. V. Denardo, Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants. Operations Research. (1988), Vol.36, No.5, pp.778-784. https://doi.org/10.1287/opre.36.5.778
  10. J. Han, Y. Lee, S. Kim and E. Park, An Alternative Modeling for Lot-sizing and Scheduling Problem with a Decomposition Based Heuristic Algorithm. Journal of the Korean Institute of Industrial Engineers. (2007), Vol.33, No.3, pp.373-380.