Publications
Detailed Information
Approximation of k-batch consolidation problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Sung-Pil | - |
dc.contributor.author | Park, Myoung-Ju | - |
dc.contributor.author | Chang, Soo Y. | - |
dc.date.accessioned | 2009-07-08T05:52:37Z | - |
dc.date.available | 2009-07-08T05:52:37Z | - |
dc.date.issued | 2008-11-24 | - |
dc.identifier.citation | Theoretical Computer Science 410 (2009) 963-967 | en |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://hdl.handle.net/10371/5331 | - |
dc.description.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, 2Hk−1, where... | en |
dc.description.sponsorship | The research was partially supported by the Second Stage of Brain Korea 21 Project in
2008. | en |
dc.language.iso | en | - |
dc.publisher | Elsevier | en |
dc.subject | k-batch consolidation problem | en |
dc.subject | Inapproximability | en |
dc.subject | Approximation algorithm | en |
dc.subject | k-set cover problem | en |
dc.title | Approximation of k-batch consolidation problem | en |
dc.type | Article | en |
dc.contributor.AlternativeAuthor | 홍성필 | - |
dc.contributor.AlternativeAuthor | 박명주 | - |
dc.identifier.doi | 10.1016/j.tcs.2008.11.007 | - |
dc.identifier.doi | 10.1016/j.tcs.2008.11.007 | - |
dc.citation.journaltitle | Theoretical Computer Science | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.