Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Demand-driven, iterative capacity allocation and cycle time estimation for re-entrant lines
 
  • Details

Demand-driven, iterative capacity allocation and cycle time estimation for re-entrant lines

Journal
Proceedings of the IEEE Conference on Decision and Control
Journal Volume
3
Pages
2270-2275
Date Issued
1999-12
Date
1999-12
Author(s)
SHI-CHUNG CHANG  
DOI
10.1109/CDC.1999.831259
URI
http://ntur.lib.ntu.edu.tw//handle/246246/2007041910021683
https://www.scopus.com/inward/record.uri?eid=2-s2.0-0033347355&doi=10.1109%2fCDC.1999.831259&partnerID=40&md5=3343577f60c626e3feec8532cb1ecf3e
Abstract
Daily production target setting for each production stage of a semiconductor wafer fabrication factory (fab) is a challenging machine capacity allocation problem due to the complex and re-entrant process flows. This paper summarizes a methodology developed by the author and his colleagues for the design of a daily target setting system (TSS) over the past few years. The methodology realizes PULL-then-PUSH and proportional capacity allocation principles to meet production demands in a smooth way while maximizing machine utilization. As machine capacity allocation and available wafer flows are intertwined, the target setting problem can be viewed as a fixed-point iteration problem. A deterministic queueing analysis-based algorithm is designed to estimate cycle times and hence wafer flows. The methodology iterates between capacity allocation and cycle time estimation until a fixed-point capacity allocation is achieved. Recorded field implementation results of various versions of TSS based on the methodology include a decline of average total WIP by 8%, an increase of daily total wafer flows by nearly 20%, an increase in target achieving rate at the shop floor by more than 10%, the reduction of average cycle time per layer from 3.25 to 2.96 days, and the reduction of average +2 sigma of per-layer cycle time from 4.63 to 3.68.
Other Subjects
Algorithms; Iterative methods; Optimization; Queueing theory; Resource allocation; Semiconductor device manufacture; Deterministic queueing analysis based algorithm; Machine capacity allocation problem; Proportional capacity allocation principles; Target setting system; Scheduling
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

00831259.pdf

Size

685.02 KB

Format

Adobe PDF

Checksum

(MD5):5f68398c4aa8f2fe807ad598c746fcbf

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science