期刊
JOURNAL OF INTELLIGENT MANUFACTURING
卷 29, 期 3, 页码 603-615出版社
SPRINGER
DOI: 10.1007/s10845-015-1039-3
关键词
Flexible job-shop scheduling problem; Makespan; Particle swarm optimization algorithm; Routing and scheduling; Multi-agent system; Enmbeded system
Flexible job-shop scheduling problem (FJSP) is very important in many research fields such as production management and combinatorial optimization. The FJSP problems cover two difficulties namely machine assignment problem and operation sequencing problem. In this paper, we apply particle swarm optimization (PSO) algorithm to solve this FJSP problem aiming to minimize the maximum completion time criterion. Various benchmark data taken from literature, varying from Partial FJSP and Total FJSP, are tested. Experimental results proved that the developed PSO is enough effective and efficient to solve the FJSP. Our other objective in this paper, is to study the distribution of the PSO-solving method for future implementation on embedded systems that can make decisions in real time according to the state of resources and any unplanned or unforeseen events. For this aim, two multi-agent based approaches are proposed and compared using different benchmark instances.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据