Abstract
With the properties of multi-objective job shop problem (MOJSP) in mind, we integrate the multiagent systems and evolutionary algorithms to form a new algorithm, multiagent evolutionary algorithm for MOJSP (MAEA-MOJSP). In MAEA-MOJSP, an agent represents a candidate solution to MOJSP, and all agents live in a latticelike environment. Making use of three designed behaviors, the agents sense and interact with their neighbors. In the experiments, eight benchmark problems are used to test the performance of the algorithm proposed. The experimental results show that MAEA-MOJSP is effective.
This work was supported by the National Natural Science Foundation of China under Grant 60872135, 60803098, and 60970067, and the National Research Foundation for the Doctoral Program of Higher Education of China under Grant 20070701022.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lei, D., Wu, Z.: Crowding-measure-based Multiobjective Evolutionary Algorithm for Job Shop Scheduling. The International Journal of Advanced Manufacturing Technology 30(1-2), 112–117 (2006)
Esuqivel, S., Ferrero, S., Gallard, R., Salto, C., Alfonso, H., Schotz, M.: Enhanced Evolutionary Algorithms for Single and Multi-objective Optimization in the Job Shop Scheduling Problem. Knowl.-Based Syst. 15, 13–25 (2002)
Qian, B., Wang, L., Huang, D., Wang, X.: Scheduling Multi-objective Job Shop Using a Memtic Algorithm Based on Differential Evolution. Int. J. Adv. Manuf. Technol. 35, 1014–1027 (2008)
Dell, A.M., Trubia, M.: Applying Tabu Search to the Job Shop Scheduling Problem. Ann. Oper. Res. 40, 231–252 (1993)
Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (2002)
Liu, J., Zhong, W., Jiao, L.: A Multiagent Evolutionary Algorithm for Constraint Satisfaction Problems. IEEE Trans. Syst., Man, and Cybern. B 36(1), 54–73 (2006)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
http://people.brunel.ac.uk/~mastjjb/jeb/orlib/jobshopinfo.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duan, X., Liu, J., Zhang, L., Jiao, L. (2010). Multi-Objective Job Shop Scheduling Based on Multiagent Evolutionary Algorithm. In: Deb, K., et al. Simulated Evolution and Learning. SEAL 2010. Lecture Notes in Computer Science, vol 6457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17298-4_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-17298-4_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17297-7
Online ISBN: 978-3-642-17298-4
eBook Packages: Computer ScienceComputer Science (R0)