Approximation of a batch consolidation problem

Authors

  • Junho Chang,

    1. Department of Industrial and Management Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, Republic of Korea
    Search for more papers by this author
  • Soo Y. Chang,

    1. Department of Industrial and Management Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, Republic of Korea
    Search for more papers by this author
  • Sung-Pil Hong,

    Corresponding author
    1. Department of Industrial Engineering, Seoul National University, San 56-1 Shilim-Dong, Kwanahk Gu, Seoul, 151-742, Republic of Korea
    • Department of Industrial Engineering, Seoul National University, San 56-1 Shilim-Dong, Kwanahk Gu, Seoul, 151-742, Republic of Korea
    Search for more papers by this author
  • Yun-Hong Min,

    1. Department of Industrial Engineering, Seoul National University, San 56-1 Shilim-Dong, Kwanahk Gu, Seoul, 151-742, Republic of Korea
    Search for more papers by this author
  • Myoung-Ju Park

    1. Department of Industrial Engineering, Seoul National University, San 56-1 Shilim-Dong, Kwanahk Gu, Seoul, 151-742, Republic of Korea
    Search for more papers by this author

Abstract

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, PNP. However, the problem admits a equation image -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. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 12–19 2011

Ancillary