作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (2): 269-271. doi: 10.3969/j.issn.1000-3428.2011.02.095

• 开发研究与设计技术 • 上一篇    下一篇

柔性作业车间调度的多Agent协商策略

任海英,商晓坤   

  1. (北京工业大学经济与管理学院,北京 100124)
  • 出版日期:2011-01-20 发布日期:2011-01-25
  • 作者简介:任海英(1971-),男,副教授、博士,主研方向:多Agent系统;商晓坤,硕士研究生

Negotiation Strategies for Multi-Agent Flexible Job-shop Scheduling

REN Hai-ying, SHANG Xiao-kun   

  1. (School of Economic and Management, Beijing University of Technology, Beijing 100124, China)
  • Online:2011-01-20 Published:2011-01-25

摘要: 柔性作业车间调度问题是经典作业车间调度问题的扩展。为此,提出一种新的基于招投标的多Agent协商调度策略,并研究各Agent协商时的价格函数。系统主要由工件Agent和机器Agent组成,工件Agent通过招投标的方式,选择合适的机器完成加工任务,机器Agent按照市场机制通过自由竞争获得工件的加工权,根据基于规则的调度策略处理工件。用Java设计仿真实验程序,并通过实验验证所提价格协商函数的有效性。

关键词: 多Agent系统, 柔性作业车间调度问题, 平均延迟

Abstract: The Flexible Job-shop Scheduling Problem(FJSP) is a generalization of the classical Job-shop Scheduling Problem(JSP). In this paper, a multi-Agent negotiation and scheduling strategy based on biding is proposed. This study focuses on bid calculation. The system contains part Agent and machine Agent. Through biding part Agent selects the appropriate machine and machine Agent selects the appropriate part by competing with others based on market mechanism to maximize its income and use dispatching rules to schedule the parts. The system is implemented in Java and the proposed algorithm is tested on a standard instance taken from the literature and compared with other approaches. Experimental results show the effectiveness of the negotiation function.

Key words: multi-Agent system, Flexible Job-shop Scheduling Problem(FJSP), mean tardiness

中图分类号: