Solving volume and capacity planning problems in semiconductor manufaturing: A computational study

In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a general product structure that includes commodities, custom products, finished products between these two extreme classes, and several types of unfinished products. Computational experiments with respect to the required level of detail of bottleneck modeling are performed. Furthermore, we investigate the sensitivity of the model with respect to noisy demand data. It turns out that the number of modeled bottleneck is not crucial and that our approach can treat noisy demand data appropriately.