Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/139260
Title: The job dispatch control policy for production lines with queue time constraints in semiconductor wafer fabrication
Authors: Lu, Lin
Keywords: Engineering::Mechanical engineering
Issue Date: 2020
Publisher: Nanyang Technological University
Project: B041
Abstract: The production lines become more and more complex with increasing demands from mass production to customised production. In the semiconductor fab, there are many recipes which requires different processes and different priorities. In addition, overlapped time window constraints and product mix make it more difficult to manage production lines.Thus, the application of queueing theory becomes extremely important to improve efficiency of the factory. A practical control theory is necessary to be used for engineers to manage products more efficiently and automatically. In this report, two methods are studied to develop the control policy for the production line with product mix and overlapped time constraints. The first method is to directly calculate the accurate cycle time using the formula we developed for each kind of product of the original queuing system. The second method uses reduction method to simplify the original queueing system so as to decrease the computation time. This article is organized as follows: Section 2 reviews the literature in this field. Section 3 provides theorems for developing approximations and calculations of the waiting time and the cycle time. Section 4 gives the simulation validation. Finally, conclusions are drawn in Section 5.
URI: https://hdl.handle.net/10356/139260
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Final_Report.pdf
  Restricted Access
18.47 MBAdobe PDFView/Open

Page view(s)

215
Updated on Feb 7, 2023

Download(s)

3
Updated on Feb 7, 2023

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.