National Taiwan Ocean University Institutional Repository:Item 987654321/51641
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 28611/40652
造访人次 : 755847      在线人数 : 50
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51641

题名: A Heuristic Scheduling Method for FMSs Using Approximate Solutions of Petri Net State Equations,
作者: C.S. Lin
M.D. Jeng
贡献者: 國立臺灣海洋大學:電機工程學系
关键词: heuristic search
timed Petri nets
near-optimal schedules
makespan
日期: 1996-11
上传时间: 2018-12-13T08:05:55Z
出版者: Proceedings of the Fourth International Conference on Automation Technology, Hsinchu, Taiwan, ROC, pp. 381-387, July 1996
摘要: Abstract: This paper proposes a new heuristic search approach based on an analytic theory of the Petri net state equations for scheduling flexible manufacturing systems (FMSs) with the goal of minimizing makespan. The proposed method models an FMS using a timed Petri net and exploits approximate solutions of the net's state equation to predict the total cost (makespan) from the initial state through the current state to the goal. That is, the heuristic function considers global information provided by the state equation. This makes the method possible to obtain solutions better than those obtained using prior works (Lee and DiCesare, 1994a, 1994b) that consider only the current status or limited global information. In addition, to reduce memory requirement and thus to increase the efficiency of handling larger systems, the proposed scheduling algorithm contains a procedure to reduce the searched state space.
關聯: 10(2) pp.139-162
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51641
显示于类别:[電機工程學系] 期刊論文

文件中的档案:

档案 描述 大小格式浏览次数
index.html0KbHTML23检视/开启


在NTOUR中所有的数据项都受到原著作权保护.

 


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