The characteristics of flexible job shop scheduling problem（ FJSP） are analyzed, and a multiagent approach based on a tabu search method is proposed. The proposed model is composed of following three classes of agents: job agents, resource agents and interface agent. The interface agent contains the tabu search core. Tests are carried out with the same instances from the literature, and results show that the multiagent approach based on a tabu search method can efficiently solve FJSP.
Key words
flexible jobshop scheduling /
multiagent system /
tabu search
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
References
［1］梁迪,谢里阳,隋天中,等.基于遗传和禁忌搜索算法求解双资源车间调度问题［J］.东北大学学报：自然科学版, 2006, 27(8):895-898.
LIANG Di, XIE Li-yang, SUI Tian-zhong, et al. Scheduling optimization based on hybrid genetictabu search algorithm for dualresource constrained job shop ［J］. Journal of Northeastern University : Natural Science, 2006, 27(8):895-898.(in Chinese)
［2］ BRUCKER, P, NEYER, J. Tabu search for the multimode jobshop problem ［J］, OR Spektrum, 1998, 20: 21-28.[ZK)]
［3］ 任海英, 商晓坤. 柔性作业车间调度的多Agent协商策略［J］. 计算机工程, 2011, 37(2):269-271.
REN Hai-ying, SHANG Xiao-kun. Negotiation strategies for multiagent flexible jobshop scheduling ［J］. Computer Engineering, 2011, 37(2):269-271.(in Chinese)
［4］ 任海英, 孙宏玲. 一种基于多agent的柔性车间调度系统研究［J］. 机械设计与制造, 2010(5): 88-90.
REN Hai-ying, SUN Hong-ling. Research on multiagentbased flexible job shop scheduling system ［J］. Machinery Design & Manufacture, 2010(5): 88-90.(in Chinese)
［5］GLOVER F. Future paths for integer programming and links to artificial intelligence［J］. Computers and Operations Research, 1986, 5:533-549.
［6］MASTROLILLI M, GAMBARDELLA L M. Effective neighborhood functions for the flexible job shop problem ［J］. Journal of Scheduling, 2000, 3(1):3-20.
［7］BRANDIMARTE P. Routing and scheduling in a flexible job shop by tabu search ［J］. Annals of Operations Research, 1993, 41:157-183.
PDF(507 KB)
