Skip to main content
Log in

A new immune multi-agent system for the flexible job shop scheduling problem

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Al-Hinai, N., & ElMekkawy, T. Y. (2013). Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. International Journal of Production Economics, 132, 279–291.

    Article  Google Scholar 

  • Asadzadeh, L., & Zamanifar, K. (2010). An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52, 1957–1965.

    Article  Google Scholar 

  • Bagheri, A., Zandieh, M., Mahdavi, I., & Yazdani, M. (2010). An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Computer Systems, 26, 533–541.

    Article  Google Scholar 

  • Balas, E. (1969). Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17(6), 941–957.

    Article  Google Scholar 

  • Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157–183.

    Article  Google Scholar 

  • Chou, Y., Cao, H., & Cheng, H. H. (2013). A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling. Journal of Manufacturing Systems, 32, 752–763.

    Article  Google Scholar 

  • Dasgupta, D. (1998). An artificial immune system as a multi-agent decision support system. In 1998 IEEE international conference on systems, man, and cybernetics (pp. 3816–3820). San Diego, USA: IEEE.

  • Dasgupta, D., Yu, S., & Nino, F. (2011). Recent advances in artificial immune systems: Models and applications. Applied Soft Computing, 11, 1574–1587.

    Article  Google Scholar 

  • De Giovanni, L., & Pezzella, F. (2010). An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. European Journal of Operational Research, 200, 395–408.

    Article  Google Scholar 

  • Ennigrou, M., & Ghédira, K. (2008). New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. Autonomous Agent and Multi-Agent Systems, 17, 270–287.

    Article  Google Scholar 

  • Gao, K. Z., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. S. (2014). Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. Journal of Intelligent Manufacturing, 1–12. doi:10.1007/s10845-014-0869-8.

  • Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.

    Article  Google Scholar 

  • Janeway, C. A., Travers, P., Walport, M., & Shlomchik, M. J. (2001). Immunobiology. New York: Garland Science.

    Google Scholar 

  • Kacem, I., Hammadi, S., & Borne, P. (2002a). Approach by localization multi-objective evolutionary optimization for flexible job-shops scheduling problems. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 32(1), 1–13.

    Article  Google Scholar 

  • Kacem, I., Hammadi, S., & Borne, P. (2002b). Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computer Simulation, 60(3–5), 245–276.

    Article  Google Scholar 

  • Lei, D. (2010). A genetic algorithm for flexible job shop scheduling with fuzzy processing time. International Journal of Production Research, 48(10), 2995–3013.

    Article  Google Scholar 

  • Lei, D., & Guo, X. (2014). Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. International Journal of Production Research, 52(9), 2519–2529.

    Article  Google Scholar 

  • Moslehi, G., & Mahnam, M. (2011). A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. International Journal of Production Economics, 129, 14–22.

    Article  Google Scholar 

  • Nie, L., Gao, L., Li, P., & Li, X. (2013). A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. Journal of Intelligent Manufacturing, 24, 763–774.

    Article  Google Scholar 

  • Nouiri, M., Bekrar, A., Jemai, A., Niar, S., & Ammari, A. C. (2015). An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. Journal of Intelligent Manufacturing, 1–13. doi:10.1007/s10845-015-1039-3.

  • Osborne, M. J., & Rubinstein, A. (1994). A course in game theory. Cambridge, MA: MIT.

    Google Scholar 

  • Ouelhadj, D., & Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12(4), 417–431.

    Article  Google Scholar 

  • Pérez, M. A. F., & Raupp, F. M. P. (2014). A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. Journal of Intelligent Manufacturing, 1–8. doi:10.1007/s10845-014-0872-0.

  • Rahmati, S. H. A., & Zandieh, M. (2012). A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 58(9–12), 1115–1129.

    Article  Google Scholar 

  • Rahmati, S. H. A., Zandieh, M., & Yazdani, M. (2013). Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 64(5–8), 915–932.

    Article  Google Scholar 

  • Rajabinasab, A., & Mansour, S. (2011). Dynamic flexible job shop scheduling with alternative process plans: An agent-based approach. The International Journal of Advanced Manufacturing Technology, 54(9–12), 1091–1107.

    Article  Google Scholar 

  • Shao, X., Liu, W., Liu, Q., & Zhang, C. (2013). Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 67(9–12), 2885–2901.

    Article  Google Scholar 

  • Shen, W. (2002). Genetic algorithms in agent-based manufacturing scheduling systems. Integrated Computer-Aided Engineering, 9, 207–217.

    Google Scholar 

  • Shen, W., & Norrie, D. H. (1999). Agent-based systems for intelligent manufacturing: A state-of-the-art survey. Knowledge and Information Systems, 1, 129–156.

    Article  Google Scholar 

  • Tayebi Araghi, M. E., Jolai, F., & Rabiee, M. (2014). Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach. International Journal of Computer Integrated Manufacturing, 27(8), 733–746.

    Article  Google Scholar 

  • Vilcot, G., & Billaut, J. C. (2011). A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. International Journal of Production Research, 49(23), 6963–6980.

    Article  Google Scholar 

  • Wang, L., Zhou, G., Xu, Y., & Liu, M. (2013a). A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem. International Journal of Production Research, 51(12), 3593–3608.

  • Wang, Y. M., Yin, H. L., & Qin, K. D. (2013b). A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions. The International Journal of Advanced Manufacturing Technology, 68(5–8), 1317–1326.

  • Weng, M. X., Wu, Z., Qi, G., & Zheng, L. (2008). Multi-agent-based workload control for make-to-order manufacturing. International Journal of Production Research, 46(8), 2197–2213.

    Article  Google Scholar 

  • Wu, X., & Wu, S. (2015). An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. Journal of Intelligent Manufacturing, 1–17. doi:10.1007/s10845-015-1060-6.

  • Wu, Z., & Weng, M. X. (2005). Multiagent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics, 35(2), 293–301.

    Article  Google Scholar 

  • Xiang, W., & Lee, H. P. (2008). Ant colony intelligence in multi-agent dynamic manufacturing scheduling. Engineering Applications of Artificial Intelligence, 21(1), 73–85.

    Article  Google Scholar 

  • Xiong, W., & Fu, D. (2012). Multi-agent system for flexible job-shop scheduling problem based on human immune system. In Proceedings of the 31st Chinese control conference (pp. 2476-2480). Hefei, China: Technical Committee on Control Theory, Chinese Association of Automation.

  • Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38, 3563–3573.

  • Ziaee, M. (2014). A heuristic algorithm for solving flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 71(1–4), 519–528.

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by Hebei Education Department of China under Grant Q2012143.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Xiong.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical standard

All the authors declare that our manuscript complies with the ethical rules applicable for Journal of Intelligent Manufacturing.

Funding

This study was funded by Hebei Education Department of China (Grant Number Q2012143).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiong, W., Fu, D. A new immune multi-agent system for the flexible job shop scheduling problem. J Intell Manuf 29, 857–873 (2018). https://doi.org/10.1007/s10845-015-1137-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1137-2

Keywords

Navigation