English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27248/39091
Visitors : 2415653      Online Users : 75
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51109

Title: Application of Petri Nets and Lagrangian Relaxation to Scheduling Automatic Material-Handling Vehicles in 300-mm Semiconductor Manufacturing
Authors: Da-Yin Liao
Mu-Der Jeng
MengChu Zhou
Contributors: 國立臺灣海洋大學電機工程學系
Date: 2007-07
Issue Date: 2018-11-13T01:45:30Z
Publisher: IEEE Transactions on Systems, Man, and Cybernetics – Part C
Abstract: Abstract: This paper deals with vehicle-scheduling problem (VSP) in an automatic material-handling environment in 300-mm semiconductor wafer manufacturing. We adopt Petri nets (PNs) modeling techniques to model the complicated coupling dynamics among transport jobs and overhead hoist transport (OHT) vehicles in a 300-mm OHT loop. The congestion phenomenon among OHT vehicles is captured. With help of the PN models, we formulate the OHT VSP as an integer programming problem whose objective is to schedule OHT vehicles to transport jobs such that average job completion time is minimized. Instead of solving for the optimal solution, we develop a solution methodology to generate a feasible schedule efficiently. A Lagrangian relaxation step is first taken to decompose the PN-based, integer programming problem into individual job-scheduling subproblems. To reduce computation efforts in solving each subproblem optimally, we develop an approximation method to solve each job subproblem by utilizing a reduced PN model of the job. Lagrangian multipliers are then optimized by a surrogate subgradient method. A heuristic algorithm is developed to adjust the dual solution to a feasible schedule. Numerical results demonstrate that our solution methodology can generate good schedules within a reasonable amount of computation time for realistic problems. Compared to a popular vehicle-dispatching rule, our approach can achieve in average 32% improvements on the average delivery time in our realistic test cases.
Relation: 37(4) pp.504-516
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51109
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML29View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback