Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

A ${\frac{1}{3}}$-Approximation Algorithm for the Order Consolidation Problem

주문집약문제에 대한 ${\frac{1}{3}}$-근사해법

  • Received : 2016.11.25
  • Accepted : 2016.12.21
  • Published : 2017.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

We consider the order consolidation problem that arises in production systems where customer orders are processed in batches. The problem involves maximizing the number of batches while satisfying the following conditions: (i) the total quantity processed in each batch must be above a prescribed level; (ii) the quantity in an order can be split and processed in more than one batches; (iii) each batch can include up to two different orders but can do so only when the two orders are compatible pair. This problem is known to be NP-hard and max-SNP hard. In this study, we develop an approximation algorithm with factor 1/3.

Keywords

References

  1. 명영수, "일괄처리를 위한 배치통합문제의 근사 해법", 한국경영과학회지, 제38권, 제1호(2013), pp.61-67. https://doi.org/10.7737/JKORMS.2013.38.1.061
  2. 박종호, 임경국, 최봉하, "주문집약문제에 대한 휴리스틱 기법", 대한산업공학회지, 제34권, 제4호(2008), pp.408-413.
  3. Chang, J., S.Y. Chang, S.-P. Hong, Y.-H. Min, and M.-J. Park, "Approximation of a batch consolidation problem," Networks, Vol.58 (2011), pp.12-19. https://doi.org/10.1002/net.20409
  4. Hwang, H.C. and S.Y. Chang, "Order consolidation for match processing," Journal of Combinatorial Optimization, Vol.9(2005), pp.121-138. https://doi.org/10.1007/s10878-005-5488-z
  5. Lee, K., S.Y. Chang, and Y. Hong, "Continuous slab caster scheduling and interval graphs," Production Planning & Control, Vol.13, No.5(2004), pp.495-501.
  6. Tang, L., J. Liu, A. Ring, and Z. Yang, "A review of planning and scheduling system and methods for integrated steel production," European Journal of Operational Research, Vol.133(2001), pp.1-20. https://doi.org/10.1016/S0377-2217(00)00240-X