DocumentCode :
2864853
Title :
Scheduling FMS with a Hybrid Heuristic Search Algorithm
Author :
Huang, Bo ; Zhao, Chunxia
Author_Institution :
Sch. of Comput. Sci. & Technol., Nanjing Univ. of Sci. & Technol., Nanjing, China
fYear :
2009
fDate :
11-13 Dec. 2009
Firstpage :
1
Lastpage :
4
Abstract :
This paper presents a new scheduling method for flexible manufacturing system (FMS) in a Petri net framework. To reduce the computation complexity, an elaborate scheme is applied, which performs A* search locally and backtracking search globally in the reachability graph of the Petri net. Some numerical experiments are carried out to demonstrate usefulness of the algorithm.
Keywords :
Petri nets; backtracking; computational complexity; flexible manufacturing systems; graph theory; numerical analysis; FMS; Petri net framework; backtracking search; computation complexity; flexible manufacturing system scheduling method; hybrid heuristic search algorithm; reachability graph; Computer science; Flexible manufacturing systems; Heuristic algorithms; Job shop scheduling; Manufacturing systems; Paper technology; Petri nets; Processor scheduling; Scheduling algorithm; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4507-3
Electronic_ISBN :
978-1-4244-4507-3
Type :
conf
DOI :
10.1109/CISE.2009.5366289
Filename :
5366289
Link To Document :
بازگشت