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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Akçali, E., & Üngör, A. (2003). Approximation algorithms for degree-constrained bipartite network flow. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2869, 163–170. https://doi.org/10.1007/978-3-540-39737-3_21
Mendeley helps you to discover research relevant for your work.