Abstract
Semiconductor production turnkey service (SPTS) coordinates wafer fabrication with the outsourcing of the remaining processes including circuit probing testing (C/P testing), integrated circuit (IC) assembly and final testing for buyers. To reduce the production cost and lead time in the supply chain, wafer fabricators must be responsible for the production and distribution planning for the SPTS. Therefore, this research develops an integer-programming (IP) -based model of collaborative production-distribution planning. Under this model, multi-products, multi-stages, and multi-outsourcing factories with different processing capabilities are considered. However, the IP model cannot solve the problem within a polynomial time when the problem becomes as complicated as those in real practice. To confront this problem, we adopt and modify the generalized saving algorithm (GSA) so that the proposed algorithm can solve complicated real-world problems efficiently. The numerical results show that the proposed algorithm can significantly increase the solving efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boctor, F.F., Laporte, G., Renaud, J.: Heuristics for the traveling purchaser problem. Computers and Operations Research. 30, 491–504 (2003)
Cohen, M.A., Lee, H.L.: Strategic analysis of integrated production-distribution systems: models and methods. Operations Research 36(2), 216–228 (1988)
Cohen, M.A,, Moon, S.: An integrated plant loading model with economies of scale and scope. European Journal of Operational Research 50, 266–279 (1991)
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling salesman problem. Journal of the Operations Research Society of America 2(4), 393–410 (1954)
Dhaenens-Flipo, C., Finke, G.: An integrated model for an industrial production-distribution problem. IIE Transaction 33, 705–715 (2001)
Golden, B.L., Levy, L., Dahl, R.: Two generalization of the traveling salesman problem. OMEGA 9, 439–445 (1981)
Hwang, H.W.: A framework and development of virtual fab. Winbond electronic corporation (1998)
Ong, H.L.: Approximate algorithms for the traveling purchaser problem. Operations Research Letters 1, 201–205 (1982)
Pearn, W.L.: On the traveling purchaser problem. IEM working paper. 91-01. National Chaio Tung University (1991)
Pearn, W.L., Chien, R.C.: Improved solutions for the traveling purchaser problem. Computer & Operations Research 25, 879–885 (1998)
Ramesh, T.: Traveling purchaser problem. OPSEARCH (India) 18(2), 78–91 (1981)
Traveling Salesman Problem, http://www.tsp.gatech.edu/index.html
William, J.: Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures: theory and empirical comparisons. Management Science 27, 336–351 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, SH., Chung, IP., Lee, A.H.I. (2007). Collaborative Production-Distribution Planning for Semiconductor Production Turnkey Service. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)