Browse > Article
http://dx.doi.org/10.7737/JKORMS.2013.38.1.061

An Approximation Algorithm for 2-batch Consolidation with Small Items  

Myung, Young-Soo (단국대학교 경영학부)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.38, no.1, 2013 , pp. 61-67 More about this Journal
Abstract
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.
Keywords
2-batch Consolidation Problem; Approximation Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Epstein, L. and R.V. Stee, "Approximation schemes for packing splittable items with cardinality constraints," Algorithmica, Vol.62(2012), pp.102-129.   DOI   ScienceOn
2 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.   DOI   ScienceOn
3 Jansen, K., An approximation scheme for bin packing with conflicts, Journal of Combinatorial Optimization, Vol.3(1999), pp.363-377.   DOI
4 Jansen, K. and Öhring, S., Approximation algorithms for time constrained scheduling, Information and computation, Vol.132(1997) pp.85-108.   DOI   ScienceOn
5 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.
6 Myung, Y.S., "On the clique partition problem in weighted interval graphs," Theoretical Computer Science, Vol.396(2008), pp.290-293.   DOI   ScienceOn
7 Myung, Y.S., "An online algorithm for continuous slab caster scheduling," Production Planning and Control, Vol.21(2010), pp.339-342.   DOI   ScienceOn
8 Myung, Y.S., A new 3/2 approximation algorithm for 2-batch consolidation problem. (in preparation).
9 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.   DOI   ScienceOn
10 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.   DOI   ScienceOn
11 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.   DOI   ScienceOn
12 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.   DOI
13 Epstein, L. and A. Levin, "On bin packing with conflicts," SIAM J. Optimization, Vol. 19(2008), pp.1270-1285.   DOI   ScienceOn
14 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.   DOI   ScienceOn