Approximation Algorithms for Degree-Constrained Bipartite Network Flow
We consider a tool- and setup-constrained short-term capacity allocation problem that arises in operational level planning at a semiconductor wafer fabrication facility. We formulate this problem as a degree-constrained network flow problem on a bipartite graph. We show that the problem is NP-hard and propose the first constant factor (1/2) approximation algorithms. Experimental study demonstrates that, in practice, our algorithms give solutions that are on the average less than 1.5% away from the optimal solution in less than a second.
KeywordsApproximation algorithms network flows scheduling capacity allocation
Unable to display preview. Download preview PDF.
- 1.Akçalı, E.: On Tool- and Setup-Constrained Short-Term Capacity Allocation Problem. Ph.D. Dissertation, Purdue University, West Lafayette, Indianapolis (2001)Google Scholar
- 4.Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing – an updated survey. In: Ausiello, G., Lucertini, M., Serfini, P. (eds.) Algorithm Design for Computer System Design. Springer, Heidelberg (1984)Google Scholar
- 6.Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints, Technical Report RC 21350, I.B.M. Research Division, T.J. Watson Research Center (1998)Google Scholar
- 7.Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. of the ACM Symp. on Theory of Computing, pp. 448–456 (1983)Google Scholar
- 9.Könemann, J., Ravi, R.: Primal-dual meets local search: approximating MST’s with nonuniform degree bounds. In: Proc. of the ACM Symp. on Theory of Computing, pp. 389–395 (2003)Google Scholar