Abstract
This study addresses an optimization problem arising in multi-product manufacturing, where components are produced by cutting raw material bars. Combining components of several products on the same bar can reduce material waste, but it also creates a sequencing problem: components of different products must be stored separately until all parts of the corresponding product are completed. These unfinished product groups form work-in-progress (WIP) inventory, whose level depends on the cutting sequence of the bars. The objective is therefore to determine a bar-processing sequence that minimizes WIP inventory. Although sequencing problems are widely studied, this specific industrial variant has received limited attention. Since the number of feasible sequences grows rapidly even for small instances, exhaustive enumeration is impractical. To address the problem, an integer linear programming model and several heuristic methods, including a graph-theoretical approach, are developed, and their effectiveness is demonstrated through test examples.