A survey of factory control algorithms that can be implemented in a multi-agent heterarchy: Dispatching, scheduling, and pull

被引:141
作者
Baker, AD [1 ]
机构
[1] Univ Cincinnati, Fac Elect & Comp Engn, Cincinnati, OH 45221 USA
[2] Univ Cincinnati, Dept Comp Sci, Cincinnati, OH 45221 USA
关键词
systems and architectures; heterarchy scheduling and control; ERP; discrete optimization; heuristics; distributed artificial intelligence; agent technology; multi-agent systems;
D O I
10.1016/S0278-6125(98)80077-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper describes various multi-agent architectures, including the heterarchical architecture. It reviews the claimed advantages for multi-agent heterarchies and describes the types of factories that could use this architecture. It surveys the three common types of factory control algorithms: dispatching algorithms, scheduling algorithms, and pull algorithms. It then asks the question: which of these algorithms can be implemented in a multi-agent heterarchy? This paper describes how all common factory control algorithms used in industry can be implemented in a multi-agent heterarchy. It discusses how many of the algorithms that are popular in current research can be implemented in a multi-agent heterarchy, while others will require further research.
引用
收藏
页码:297 / 320
页数:24
相关论文
共 196 条
[1]  
ALLEN M, 1996, INTERNET ADVISOR, P14
[2]   SELF-ORGANIZING FEATURE MAPS AND THE TRAVELING SALESMAN PROBLEM [J].
ANGENIOL, B ;
VAUBOIS, GD ;
LETEXIER, JY .
NEURAL NETWORKS, 1988, 1 (04) :289-293
[3]  
[Anonymous], WALL STR J
[4]   SCHEDULING FOR MINIMIZING TOTAL ACTUAL FLOW TIME BY NEURAL NETWORKS [J].
ARIZONO, I ;
YAMAMOTO, A ;
OHTA, H .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1992, 30 (03) :503-511
[5]  
ASAMA H, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P1921, DOI 10.1109/ROBOT.1991.131907
[6]  
AUSTIN M, 1996, INTERNET, P36
[7]  
Baker A. D., 1993, IEEE Potentials, V12, P15, DOI 10.1109/45.282332
[8]  
BAKER AD, 1992, AUTOFACT 92
[9]  
BAKER AD, 1991, THESIS RENSSELAER PO
[10]  
BAKER AD, 1988 INT C COMP INT, P100