A subset sum approach to coil selection for slitting

Authors

  • Yoon T. Han Pohang University of Science and Technology
  • Soo Y. Chang Pohang University of Science and Technology

DOI:

https://doi.org/10.23055/ijietap.2015.22.3.1573

Keywords:

cutting stock, subset sum, coil slitting, 1.5 dimensional packing

Abstract

Optimizing coil slitting operation requires not only the generation of efficient slitting patterns but also the selection of coils to be slit by each pattern. When the coils to be slit are not identical, the optimal coil selection can be quite a cumbersome task. In this paper, we consider the problem of selecting coils to be slit by a given particular slitting pattern when the available coils are not identical. The objective of our problem is to maximize the customer order fulfilment while minimizing the slitting loss and overproduction. We adopt and modify a dynamic programming scheme for the subset sum problem to develop an optimal algorithm for the problem.

Author Biographies

Yoon T. Han, Pohang University of Science and Technology

PhD Candidate

Soo Y. Chang, Pohang University of Science and Technology

Published

2015-03-15

How to Cite

Han, Y. T., & Chang, S. Y. (2015). A subset sum approach to coil selection for slitting. International Journal of Industrial Engineering: Theory, Applications and Practice, 22(3). https://doi.org/10.23055/ijietap.2015.22.3.1573

Issue

Section

Production Planning and Control