SCHEDULING FLEXIBLE MANUFACTURING SYSTEMS USING PETRI NETS AND HEURISTIC-SEARCH

Petri net modeling combined with heuristic search provides a new scheduling method for flexible manufacturing systems. The method formulates a scheduling problem with a Petri net model. Then, it generates and searches a partial reachability graph to find an optimal or near optimal feasible schedule in terms of the firing sequence of the transitions of the Petri net model. The method can handle features such as routing flexibility, shared resources, lot sizes and concurrency. By following the generated schedule, potential deadlocks in the Petri net model and the system can be avoided. Hence the analytical overhead to guarantee the liveness of the model and the system is eliminated. Some heuristic functions for efficient search are explored and the experimental results are presented.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1994-04
Language
ENG
Keywords

PERFORMANCE EVALUATION

Citation

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, v.10, no.2, pp.123 - 132

ISSN
1042-296X
URI
http://hdl.handle.net/10203/57710
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 152
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 204 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0