Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. Petri Net Modeling and GA Based Scheduling for Assembly Industry
 
  • Details

Petri Net Modeling and GA Based Scheduling for Assembly Industry

Date Issued
2004
Date
2004
Author(s)
Cheng, Hsing Hung
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/54034
Abstract
In this thesis, we propose a new dispatching rule and a new sequencing rule for assembly industry in order to obtain a better overall schedule. In addition, we use a graphical and mathematical modeling tool – Colored-Timed Petri Nets (CTPN) to model the scheduling flow in an assembly plant. By use of the proposed CTPN model, we can simulate the production under some scheduling policies. Moreover, we apply Genetic Algorithm (GA) to help the underlying scheduling mechanism to obtain a near-optimal solution. In the scheduling phase, two effective rules have been proposed in addition to usage of a number of well-known methods. For the better ones, some use static information (such as setup time, processing time, due date, etc…), whereas others use dynamic information (such as remaining processing time, queue length, equipment workload, etc …). However, the aforementioned two proposed rules consider both static and dynamic information. Both set of rules together are proposed to construct the schedule. Generally speaking, these rules hold two viewpoints, namely, one is to select equipments for work order (WO) and another is to select (work order) WO for equipment. Given such mechanism, we further apply genetic algorithm (GA) based approach to search for the optimal combination of the set of rules. Our approach can be considered as taking the advantage of obtaining the next fittest WO selection when the current WO finishes its assembly operation. The hereby proposed approach not only can increase the solution space but also can help us to locate a satisfactory solution. Besides that, the CTPN based GA scheduler takes less computation time than a lot of other schedulers, so that the present scheduler can meet the need for a rapidly changing environment.
Subjects
基因演算法
斐氏網路
分派法則
製造排程
組裝工業
Petri Net
Sequencing Rule
Assembly
Scheduling
GA
Dispatching Rule
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-93-R91922105-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):c793c0790182e021c9159ff7df9e4abf

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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