S-Space College of Engineering/Engineering Practice School (공과대학/대학원) Dept. of Industrial Engineering (산업공학과) Journal Papers (저널논문_산업공학과)
Approximation of a Batch Consolidation Problem
- Chang, Junho; Chang, Soo Y.; Hong, Sung Pil; Min, Yun-Hong; Park, Myoung-Ju
- Issue Date
- NETWORKS; Vol.58 1; 12-19
- In batch production systems, multiple items can be processed in the same batch if they share sufficiently similar production parameters. We consider the batch consolidation problem of minimizing the number of batches of a finite set of items. This article focuses on the case in which only one or two items can be processed in a single batch. The problem is NP-hard and cannot be approximated within 1.0021 of the optimum under the premise, P not equal NP. However, the problem admits a 3/2-approximation. The idea is to decompose the demands of items so that a maximum matching in the graph on the vertices of the decomposed demands provides a well-consolidated batch set. (C) 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 12-19 2011
- Files in This Item: There are no files associated with this item.