全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于禁忌搜索与多Agent的柔性车间作业调度系统

, PP. 67-70

Keywords: 柔性车间作业调度,多Agent系统,禁忌搜索

Full-Text   Cite this paper   Add to My Lib

Abstract:

分析柔性作业车间调度问题的特点,并提出一种基于禁忌搜索的多Agent系统.该系统由三类Agent组成:工件Agents、机器Agents和接口Agent.接口Agent包含禁忌搜索的核心算法.最后,使用文献中相同的实例进行测试.结果表明,基于禁忌搜索的多Agent模型可以有效求解柔性车间作业调度问题.

References

[1]  [1] 梁迪,谢里阳,隋天中,等.基于遗传和禁忌搜索算法求解双资源车间调度问题[J].东北大学学报:自然科学版, 2006, 27(8):895-898.
[2]  LIANG Di, XIE Li-yang, SUI Tian-zhong, et al. Scheduling optimization based on hybrid genetictabu search algorithm for dualresource constrained job shop [J]. Journal of Northeastern University : Natural Science, 2006, 27(8):895-898.(in Chinese)
[3]  [2] BRUCKER, P, NEYER, J. Tabu search for the multimode jobshop problem [J], OR Spektrum, 1998, 20: 21-28.[ZK)]
[4]  [3] 任海英, 商晓坤. 柔性作业车间调度的多Agent协商策略[J]. 计算机工程, 2011, 37(2):269-271.
[5]  REN Hai-ying, SHANG Xiao-kun. Negotiation strategies for multiagent flexible jobshop scheduling [J]. Computer Engineering, 2011, 37(2):269-271.(in Chinese)
[6]  [4] 任海英, 孙宏玲. 一种基于多agent的柔性车间调度系统研究[J]. 机械设计与制造, 2010(5): 88-90.
[7]  REN Hai-ying, SUN Hong-ling. Research on multiagentbased flexible job shop scheduling system [J]. Machinery Design & Manufacture, 2010(5): 88-90.(in Chinese)
[8]  [5] GLOVER F. Future paths for integer programming and links to artificial intelligence[J]. Computers and Operations Research, 1986, 5:533-549.
[9]  [6] MASTROLILLI M, GAMBARDELLA L M. Effective neighborhood functions for the flexible job shop problem [J]. Journal of Scheduling, 2000, 3(1):3-20.
[10]  [7] BRANDIMARTE P. Routing and scheduling in a flexible job shop by tabu search [J]. Annals of Operations Research, 1993, 41:157-183.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133