科研之友
微信
新浪微博
Facebook
分享链接
摘要
Scheduling for the flexible job shop is very important and challenging in manufacturing field. Multi-agent-based approaches have been used to solve the flexible job shop scheduling problem (FJSP), in order to reduce complexity and cost, increase flexibility, and enhance robustness. However, the quality of solution obtained by the multi-agent approach is always worse than the centralized meta-heuristic algorithms. The immune system is a distributed and complicated information processing system, which can protect body from foreign antigens by immune responses. In this paper, we analyze the similarities between the FJSP and humoral immunity, which is one of the immune responses. Based on the similarities, we develop a new immune multi-agent scheduling system (NIMASS) to solve the FJSP with the objective of minimizing the maximal completion time (makespan). In order to acquire the higher-quality solution of the FJSP, we simulate humoral immunity to establish the architecture of NIMASS and the negotiation strategies of NIMASS, which are proposed for negotiation among agents. NIMASS was tested on different benchmark instances of the FJSP. In comparison with the multi-agent approaches and the centralized heuristic algorithms, the computational results indicate that NIMASS can effectively improve the quality of solution in very short time. And the computational time of NIMASS is superior to that of the centralized meta-heuristic algorithms, especially for the complex FJSPs. These results indicate that NIMASS can be very useful in applications that deal with real-time FJSPs.
