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

  • 제38권1호
  • /
  • Pages.61-67
  • /
  • 2013
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

일괄처리를 위한 배치통합문제의 근사해법

An Approximation Algorithm for 2-batch Consolidation with Small Items

  • 투고 : 2012.12.10
  • 심사 : 2013.02.23
  • 발행 : 2013.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider a problem of grouping orders for batch processing that arises in production systems where customer orders are processed in batches. This problem can be viewed as a variant of bin packing problem where items can be split and a pair of items can be placed in a bin when the items are compatible with each other. In this paper, we consider a special case that at most two different items can be placed in a single bin and the size of every item is at most the size of a bin.

키워드

참고문헌

  1. 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
  2. Chen, M., J. Li, J. Li, W. Li, and L. Wang, "Some approximation algorithms for the clique partition problem in weighted interval graphs," Theoretical Computer Science, Vol. 381(2007), pp.124-133. https://doi.org/10.1016/j.tcs.2007.04.030
  3. Chung, F., R. Graham, J. Mao, and G. Varghese, "Parallelism versus memory allocation in pipelined router forwarding engines," Theory of Computing Systems, Vol.39(2006), pp.829-849. https://doi.org/10.1007/s00224-006-1249-3
  4. Epstein, L. and A. Levin, "On bin packing with conflicts," SIAM J. Optimization, Vol. 19(2008), pp.1270-1285. https://doi.org/10.1137/060666329
  5. Epstein, L. and R.V. Stee, "Improved results for a memory allocation problem," Theory of Computing Systems, Vol.48, No.1(2011), pp. 79-92. https://doi.org/10.1007/s00224-009-9226-2
  6. Epstein, L. and R.V. Stee, "Approximation schemes for packing splittable items with cardinality constraints," Algorithmica, Vol.62(2012), pp.102-129. https://doi.org/10.1007/s00453-010-9445-6
  7. Hong, S.-P., M.-J. Park, and S.Y. Chang, "Approximation of k-batch consolidation problem," Theoretical Computer Science, Vol.410 (2009), pp.963-967. https://doi.org/10.1016/j.tcs.2008.11.007
  8. Jansen, K., An approximation scheme for bin packing with conflicts, Journal of Combinatorial Optimization, Vol.3(1999), pp.363-377. https://doi.org/10.1023/A:1009871302966
  9. Jansen, K. and Öhring, S., Approximation algorithms for time constrained scheduling, Information and computation, Vol.132(1997) pp.85-108. https://doi.org/10.1006/inco.1996.2616
  10. Lee, K., S.Y. Chang, and Y. Hong, "Continuous slab caster scheduling and interval graphs," Production Planning and Control, Vol.13, No.5(2004), pp.495-501.
  11. Myung, Y.S., "On the clique partition problem in weighted interval graphs," Theoretical Computer Science, Vol.396(2008), pp.290-293. https://doi.org/10.1016/j.tcs.2008.02.016
  12. Myung, Y.S., "An online algorithm for continuous slab caster scheduling," Production Planning and Control, Vol.21(2010), pp.339-342. https://doi.org/10.1080/09537280903326552
  13. Myung, Y.S., A new 3/2 approximation algorithm for 2-batch consolidation problem. (in preparation).
  14. 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