DocumentCode
2529915
Title
An efficient method of solving problems of classification and selection using minimum spanning tree in a flexible manufacturing system
Author
Liu, Pei-Sen ; Fu, Li-Chen
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear
1990
fDate
13-18 May 1990
Firstpage
2148
Abstract
An efficient method of solving problems of classification and selection in an FMS, using a minimum spanning tree, is proposed. Computer simulation examples which show a satisfactory result are provided. The total computational time spent is economical. The application of the method to these classes of problems is promising
Keywords
computational complexity; flexible manufacturing systems; pattern recognition; production control; scheduling; trees (mathematics); FMS; classification problems; computational time; minimum spanning tree; selection problems; Buildings; Classification tree analysis; Computer science; Computer simulation; Costs; Flexible manufacturing systems; Job shop scheduling; Manufacturing automation; Manufacturing processes; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on
Conference_Location
Cincinnati, OH
Print_ISBN
0-8186-9061-5
Type
conf
DOI
10.1109/ROBOT.1990.126322
Filename
126322
Link To Document