Advertisement

Approximation Algorithms for Degree-Constrained Bipartite Network Flow

  • Elif Akçalı
  • Alper Üngör
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2869)

Abstract

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.

Keywords

Approximation algorithms network flows scheduling capacity allocation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Babel, L., Kellerer, H., Kotov, V.: The k-partitioning problem. Mathematical Methods of Operations Research 47, 59–82 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123, 333–345 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 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
  5. 5.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  6. 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. 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
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)zbMATHGoogle Scholar
  9. 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
  10. 10.
    Toktay, L.B., Uzsoy, R.: A capacity allocation problem with integer side constraints. European Journal of Operational Research 109, 170–182 (1998)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Elif Akçalı
    • 1
  • Alper Üngör
    • 2
  1. 1.Department of Industrial & Systems EngineeringUniversity of FloridaGainesvilleUSA
  2. 2.Department of Computer ScienceDuke UniversityDurhamUSA

Personalised recommendations