Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Multi-disciplinary Studies | en_US |
dc.contributor | Department of Management | en_US |
dc.creator | Choi, Kam-yau | - |
dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/4084 | - |
dc.language | English | en_US |
dc.publisher | Hong Kong Polytechnic University | - |
dc.rights | All rights reserved | en_US |
dc.title | Queuing theory on semiconductor flow line | en_US |
dcterms.abstract | This dissertation studies a semiconductor manufacturing company at Hong Kong, which belongs to an international enterprise. This enterprise has several other similar manufacturing companies at other countries. Based on the updated information, the enterprise still cannot be the market leader at the semiconductor field either on both volume and price. The ultimate objective of this dissertation is to rise up Hong Kong plant's production volume with lower price. To achieve this objective, the tandem queue theory with the idea of a birth-death process is used to develop a mathematical model for the typical production method in this Hong Kong semiconductor manufacturing company. The production is having infinite input of bare lead-frame at random with exponential arrival time and the components such as die, wire and plastic casing are assembled on this lead-frame and then the following processes such as de-flashing, solder plating, visual inspection, electrical testing, cutting, laser marking and packaging are done with exponential service time on the semi-products in order of arrival at each of a number of machines in series. Finite buffers are locating among the machines to prevent belt stop due to line blocking. The developed model shows that the queue length before each machine is independent among the machines and that installing infinite buffer among the machines can make the production line non stop theoretically. Actually, it is impossible to have infinite buffer. A formula is then developed to find a buffer size for each machine which can give same average queue length as infinite buffer with considering the input arrival rate and the service rate of this machine. In comparing the theoretical data using the developed model or formula with the actual data collected from a production line, about buffer size and outputs, it is found that the present buffer size can already act as an infinite buffer for each machine but there are mismatching found in the output. After analyzing, the mismatching is mainly due to the down time for each machine. As it is known that space is precious at Hong Kong so that increase buffer size is the last method, the first thing to do is to decrease the down time of each machine by finding their causes. | en_US |
dcterms.extent | vi, 70 leaves : ill. (some col.) ; 30 cm | en_US |
dcterms.isPartOf | PolyU Electronic Theses | en_US |
dcterms.issued | 2000 | en_US |
dcterms.educationalLevel | All Master | en_US |
dcterms.educationalLevel | M.Sc. | en_US |
dcterms.LCSH | Semiconductors | en_US |
dcterms.LCSH | Semiconductors -- Manufactures | en_US |
dcterms.LCSH | Queuing theory | en_US |
dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
dcterms.accessRights | restricted access | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
b15531028.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.35 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/4084