Approximation of the k-batch consolidation problem

作者：Hong Sung Pil; Park Myoung Ju^*; Chang Soo Y

来源：Theoretical Computer Science, 2009, 410(8-10): 963-967.

DOI：10.1016/j.tcs.2008.11.007

• k-batch consolidation problem
• Inapproximability
• Approximation algorithm
• k-set cover problem

We consider a problem of minimizing the number of batches of a fixed capacity processing the orders of various sizes on a finite set of items. This batch consolidation problem is motivated by the production system typical in raw material industries in which multiple items can be processed in the same batch if they share sufficiently close production parameters. if the number of items processed in a batch is restricted to being up to some fixed integer k, the problem is referred to as the k-batch consolidation problem. We will show that the k-batch consolidation problem admits an approximation whose factor is twice that of the k-set cover problem. In particular, this implies an upper bound on the approximation factor, 2H(k) - 1, where H(k) = 1 1/2 ...

• 出版日期2009-3-1