Browse

Approximation of the k-batch consolidation problem

Cited 2 time in Web of Science Cited 2 time in Scopus
Authors
Hong, Sung-Pil; Park, Myoung-Ju; Chang, Soo Y.
Issue Date
2009-03-01
Publisher
ELSEVIER SCIENCE BV
Citation
THEORETICAL COMPUTER SCIENCE; Vol.410 8-10; 963-967
Keywords
k-batch consolidation problemInapproximabilityk-set cover problemApproximation algorithm
Abstract
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 + ... + 1/k (C) 2008 Elsevier B.V. All rights reserved.
ISSN
0304-3975
Language
English
URI
http://hdl.handle.net/10371/75327
DOI
https://doi.org/10.1016/j.tcs.2008.11.007
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse