A Hybrid Heuristic for PWB Capacity Expansion Problem

  • Zhongsheng Hua
  • Feihua Huang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)


In the multi-product, flexible manufacturing environment, the line capacity expansion problem for printed wiring board (PWB) assembly systems is a complex combinatorial optimization problem. A model synthesized BOM (Bill of Material) of product families and machine operation flexibility at the aggregate level is described. Since the resulting model is a large-scale two-stage stochastic integer programming problem, it may not be easy to be solved by any standard code. An approximate solution procedure is thus developed, which first reduces the dimensionality of search space by heuristic algorithms, and then deals with the reduced search space by solving a series of knapsack problems. Finally, we demonstrate the financial benefit of the model and the feasibility of our approach by numerical experiments.


Virtual Machine Knapsack Problem Product Family Part Type Demand Scenario 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rajagopalan, S., Soteriou, A.C.: Capacity Acquisition and Disposal with Discrete Facility Sizes. Management Sci. 40, 903–917 (1994)MATHCrossRefGoogle Scholar
  2. 2.
    Fine, C.H., Freund, R.M.: Optimal Investment in Product-Flexible Manufacturing Capacity. Management Sci. 36, 449–466 (1990)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Van Mieghem, J.A.: Investment Strategies for Flexible Resources. Management Sci. 44, 1071–1078 (1998)MATHCrossRefGoogle Scholar
  4. 4.
    Benjaafar, S., Gupta, D.: Scope Versus Focus - Issues of Flexibility, Capacity, and Number of Production Facilities. IIE Trans. 30, 413–425 (1998)CrossRefGoogle Scholar
  5. 5.
    Chen, Z., Li, S., Tirupati, D.: A Scenario Based Stochastic Programming Approach for Technology and Capacity Planning. Comput. Oper. Res. 29, 781–806 (2002)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Catay, B., Erenguc, S.S., Vakharaj, A.J.: Tool Capacity Planning in Semiconductor Manufacturing. Comput. Oper. Res. 30, 1349–1366 (2003)MATHCrossRefGoogle Scholar
  7. 7.
    Hood, S.J., Bermon, S., Barahona, F.: Capacity Planning under Demand Uncertainty for Semiconductor Manufacturing. IEEE Transaction on Semiconductor Manufacturing 16, 273–280 (2003)CrossRefGoogle Scholar
  8. 8.
    Hua, Z.S., Banerjee, P.: Aggregate Line Capacity Design for PWB Assembly Systems. Int. J. Prod. Res. 38, 2417–2441 (2000)MATHCrossRefGoogle Scholar
  9. 9.
    Hua, Z.S., Huang, F.H.: An Effective Genetic Algorithm Approach to Large Scale Mixed Integer Programming Problems. Appl. Math. Comput. 174, 897–909 (2006)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Hua, Z.S., Liang, L.: Heuristics to Scenario-Based Capacity Expansion Problem of PWB Assembly Systems. In: Shi, Y., Xu, W., Chen, Z. (eds.) CASDMKM 2004. LNCS (LNAI), vol. 3327, pp. 135–144. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhongsheng Hua
    • 1
  • Feihua Huang
    • 1
  1. 1.School of ManagementUniversity of Science & Technology of ChinaHefeiPeople’s Republic of China

Personalised recommendations