跳至主要内容

Global Optimization of a Semiconductor IC Supply Chain Network

Supply chain management (SCM) is defined as a set of approaches used to efficiently integrate suppliers, manufacturers, warehouses, and stores so that products are produced and distributed at the right quantities, to the right locations, and at the right time, in order to minimize overall costs while meeting service level requirements. SCM also pertains to the set of actions and decisions that attempt to synchronize demand and supply with in-process inventories, in order to ensure on-time delivery of product commitments to customers, and optimize the overall manufacturing operations from start to end.

In this paper we develop a framework for the key components of the supply chain of the semiconductor manufacturing process, including front-end (fab) operations and backend (assembly/test) operations. Within this framework we consider the conversion from wafers to units. Then we propose a QP formulation for the profit maximizing objective function with flexible demand ranges per product and fab capacities. We demonstrate the model by applying it to a case study that is based on an industry dataset and show how the solution varies between a local optimization of a single fab (for minimum wafer cost) and a globally optimal solution for the network.

Our model extends on previous work in several respects; most notable is the consideration of varying ASP’s of any product by customer, to reflect segmentation in pricing for differences in quantities sold. Other extensions pertain to the flexibility in setting the demand for each product, and in setting capacity across the product mix such that each fab has a capacity range rather than a fixed number.

On top of these extensions, there are still opportunities for further work. One that immediately comes to mind is the consideration of a different objective function to compare with the proposed quadratic objective function. Other directions include the incorporation of stock points within the supply chain, as they are used in practice to mitigate changes in the demand, and the explicit consideration of sub-problems of the SC problem within the model framework, for example the capacity planning problem for each of the fabs and/or the AT sites.

Article by Adar A. Kalir,et al,from 1 Intel Qiriat-Gat and Ben-Gurion University, Beer-Sheva, Israel

Full access: http://mrw.so/3vdPyG
Image by Fisherss Zhang,from Flickr-cc



评论

此博客中的热门博文

Electron Spin and Proton Spin in the Hydrogen and Hydrogen-Like Atomic Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52202#.VIj7tMnQrzE Author(s) Stanisław Olszewski * Affiliation(s) Institute of Physical Chemistry, Polish Academy of Sciences, Warsaw, Poland . ABSTRACT The mechanical angular momentum and magnetic moment of the electron and proton spin have been calculated semiclassically with the aid of the uncertainty principle for energy and time. The spin effects of both kinds of the elementary particles can be expressed in terms of similar formulae. The quantization of the spin motion has been done on the basis of the old quantum theory. It gives a quantum number n = 1/2 as the index of the spin state acceptable for both the electron and proton ...

Remarks on the Complexity of Signed k-Domination on Graphs

Read  full  paper  at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53574#.VMnXsCzQrzE Author(s)    Chuan-Min Lee 1 , Cheng-Chien Lo 1 , Rui-Xin Ye 2 , Xun Xu 2 , Xiao-Han Shi 2 , Jia-Ying Li 2 Affiliation(s) 1 Department of Computer and Communication Engineering, Ming Chuan University, The First American University in Asia, Taoyuan, Taiwan, Chinese Taipei . 2 Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China . ABSTRACT This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chord...

A Review of Technical Requirements for High Penetration of Wind Power Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52361#.VJN8VcCAM4 Author(s)    Yuan-Kang Wu 1 , Tung-Ching Lee 2 , Ting-Yen Hsieh 2 , Wei-Min Lin 2 Affiliation(s) 1 Department of Electrical Engineering, National Chung-Cheng University, Chiayi, Taiwan . 2 Green Energy and Environment Research Laboratories, Industrial Technology Research Institute, Hsinchu, Taiwan . ABSTRACT Renewable portfolio targets have been established in many regions around the world. Regional targets such as 20% renewable energy by year 2020 are not uncommon. As the levels of wind power penetration increase, there are many power system impacts. This work investigated possible challenges and technic...