English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27005/38806
Visitors : 2402390      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/51164

Title: Heuristic Search Based on Petri Net Structures for FMS Scheduling
Authors: Mu Der Jeng
Shih Chang Chen
Contributors: 國立臺灣海洋大學電機工程學系
Keywords: Flexible manufacturing system
scheduling
Petri net
heuristic search
Date: 1999-01
Issue Date: 2018-11-15T01:09:52Z
Publisher: IEEE Transactions on Industry Applications
Abstract: Abstract: A heuristic search method using Petri net structures for flexible manufacturing system (FMS) scheduling is presented. To minimize makespan, an FMS scheduling problem is formulated as finding a firing sequence from the initial state to the final state of a timed Petri net model, such that the sequence reveals the minimal cost. The reachability graph is partially generated and searched. The search process is guided by a heuristic function based on firing count vectors of the state equation, predicting the total cost. Since this heuristic search exploits the linear characteristics of the state equation, which contains sufficient global information, it can efficiently generate a near-optimal or optimal solution. To deal with large systems, the proposed algorithm exploits the concurrency information to reduce the searched state space.
Relation: 35(1) pp.196-202
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51164
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML5View/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