Write a 6 pages paper on route planning for two wafer fabs with capacity-sharing mechanisms. The equipment that is required for the two fabs is then moved into space over a given period of time. This movement is dependent on market demand. For a dual fab of this nature, the most appropriate approach is running each fab separately and this will lead to underutilization of equipment available and to solve this problem, a cross fab production paradigm for production and this should give a problem that gives a route. Toba et al (2005) proposed a real time solution for this problem.

This research arises from the increasing demand for semiconductor materials in the manufacturing industry. In order to fill this gap, there is needed to come up with a system that allows for full utilization of the available space and equipment.

Never use plagiarized sources. Get Your Original Essay on
Write a 6 pages paper on route planning for two wafer fabs with capacity-sharing mechanisms.
Hire Professionals Just from $11/Page
Order Now Click here

2. Each product has at least four available routes of production. These routes are divided into two sections whereby the cutoff point of the routes exists. These two routes can be manufactured in two different fabs and this results in two possible routes for use in cross fab production. One of the routes is represented by and this means that the first part of the route is manufactured at fab_A and the second part is manufactured at fab_B. The other part denotes the first part of the route being manufactured at fab_B while the second part of the route being manufactured at fab_A. We are thus left with the four routes which are: and.

3. The path of transport that is available between any two stations is very unique. To reduce the complexity of controlling the traffic, we must define a fixed path. If we let the cutoff point and route and the route ratios of the product I will be represented by. If we define as a set of cut-off points and. The route planning problem will then be given by.

According to Binh & Lan (2007, Module 1 deals with the static capacity allocation whereby each path of transportation is assumed to be equipped&nbsp.with infinite capacity and the time of transportation between any two available workstations is zero. We must find the optimum value. To solve this problem, we must use an iterate use of a linear program model.

Open chat
Lets chat on via WhatsApp
Hello, Welcome to our WhatsApp support. Reply to this message to start a chat.