Customer Capacity Exchange Procedure and Algorithm for Schedule Change in the Semiconductor Industry
Short-term unbalance of capacity between supply and demand happens frequently in semiconductor manufacturing. Under the condition that not delaying the confirmed orders, this thesis intends to solve the capacity exchange problem so as to transfer the capacity of a prescheduled order to the inserted order. First, customer capacity exchange procedure is formed by the screen module, algorithm for schedule change, evaluation module, and request for quotation module. Let the known schedule, process, and the information of new order get into the screen module, to find some candidates. Then let the data be the input to run the algorithm for schedule change, and there would be a priority. Through the evaluation module, we could have the changeable orders menu, and then we could request for the quotation and negotiate prices. After these processes, we could finish this procedure. Next, the algorithm for schedule change is formed by the capacity similarity between the given orders and the new order, and by the product similarity also between the given orders and the new order from the bottleneck machine. The capacity similarity shows both the capacity of original situation and also the changed situation, and let us realize which given order is suitable to exchange. And the products similarity is used by algorithm to formulate the degree of similarity between given orders and new orders.
|Appears in Collections:||Thesis|