Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. Ant Colony Optimization Method for Time Window Constrained Batching and Scheduling Problem
 
  • Details

Ant Colony Optimization Method for Time Window Constrained Batching and Scheduling Problem

Date Issued
2007
Date
2007
Author(s)
Hung, Yu Hui
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/49120
Abstract
The mathematical model of a time window constrained batching and scheduling problem is rigorously defined. This problem is subject to process type constraints between operations and machines, precedence constraints between operations of a job, machine batch capacity limits, and the time window constraints between two successive operations. Three Ant Colony Optimization (ACO) solution construction procedures are developed for finding the maximum machine utilization in the time window constrained batching and scheduling problem. The first is the TW-SOFT computation mode that regards time window constraints as soft constraints. The second is the TW-HARD computation mode that regards time window constraints as hard constraints. The third is the TW-semiHARD computation mode that treats time window constraints as soft constraint, but considers them hard constraints in candidate set construction process. Four heuristic terms are proposed to guide the ACO solution search. Among them, the MSD aims to start an operation right after its predecessor is completed; the MPD aims to fully utilize time capacities of machines; the MSPD is a hybrid of the MSD and MPD; and the MSCmax aims to minimize the maximum completion time of machines. A software prototype system is developed to implement the proposed computation modes and heuristic terms. In the system, five ACO methods are implemented with the proposed ACO technique for the discussed problem. Several numerical tests are conducted to evaluate performances of the five implemented ACO methods, including the AS, ACS, ASelite, ASrank, and SDAS. Combinations of the proposed computation modes and heuristic terms are tested to evaluate their performances. Numerical results show that the TW-semiHARD mode and MSCmax heuristic term outperforms others. In addition, the ACS, SDAS, ASelite, and ASrank are better choices for the problem.
Subjects
具時窗限制的併批暨排程優化問題
時窗限制排程問題
批次機台排程
蟻拓最佳化演算法
time window constrained batching and scheduling problem
scheduling of batch processor
Ant Colony Optimization
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-96-R94546003-1.pdf

Size

23.53 KB

Format

Adobe PDF

Checksum

(MD5):2361030d34c567f18aaab2a732e42a9e

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