대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제34권4호
  • /
  • Pages.408-413
  • /
  • 2008
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

주문 집약 문제에 대한 휴리스틱 기법

The Heuristic Approach to the Order Consolidation Problem

  • 박종호 (포항공과대학교 산업경영공학부) ;
  • 임경국 (포항공과대학교 산업경영공학부) ;
  • 최봉하 (한국에너지기술연구원 정책연구센터)
  • Park, Jongho (Department of Industrial and Management Engineering, POSTECH) ;
  • Lim, Kyungkuk (Department of Industrial and Management Engineering, POSTECH) ;
  • Choi, Bongha (Energy Policy Research Center, Korea Institute of Energy Research (KIER))
  • 투고 : 2008.01.12
  • 심사 : 2008.06.03
  • 발행 : 2008.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch within a fixed capacity. Our objective is to maximize the total number of batches filled up to the batch size. In this paper, we study the Level-2 problem where at most 2 kinds of orders can be grouped in a batch. This problem is known to be NP-hard and Max SNP-hard. So we develop heuristic algorithm and evaluate the performance of the algorithm.

키워드

과제정보

연구 과제 주관 기관 : 한국학술진흥재단

참고문헌

  1. Bongha, Choi, S. Y. Chang, and June-Ho Chang (2007), The heuristic approach to the order consolidation problem, Proceedings of the Conference of Korean Institute of Industrial Engineers
  2. Hwang, H. C. and S. Y. Chang (2005), Order consolidation for batch processing, Journal of Combinatorial Optimization, 9, 121-138 https://doi.org/10.1007/s10878-005-5488-z
  3. June-Ho Chang and S. Y. Chang (2006), Minimum batch cover for efficient order consolidation, Proceedings of the Joint Conference of Korean Institute of Industrial Engineers and Korean Operations Research and Management Science Society
  4. Kangbok, Lee, S. Y. Chang, and Y. S. Hong (2004), Continuous slab caster scheduling and interval graph, Production Planning and Control, 15, 495-501 https://doi.org/10.1080/09537280410001714279
  5. L. Tang, J. Liu, A. Ring, and Z. Yang (2001), A review of planning and scheduling systems and methods for integrated steel production, European Journal of Operational Research, 133, 1-20 https://doi.org/10.1016/S0377-2217(00)00240-X
  6. S. Micali and V. V. Vazirani (1980), An O(${\sqrt}{{\left|}V{\right|}}$$\times$${\left|}E{\right|}$)algorithm for finding maximum matching in general graphs, in Proc. Twenty -first Annual Symposium on the Foundations of Computer Science, 17-27
  7. S. Y. Chang, M. R. Chang, and Y. S. Hong (2000), A lot grouping algorithm for a continuous slab caster in an integrated steel mill, Production Planning and Control, 11, 363-368. https://doi.org/10.1080/095372800232090
  8. Y. H. Min, S. P. Hong, S. W. Kwon, B. C. Choi, and S. Y. Chang (2007), Maximum batch cover for order consolidation, Proceedings of the Conference of Korean Operations Research and Management Science Society