Abstract
Generated by integrating the multiagent systems and evolutionary algorithms, Multiagent Evolutionary Algorithm for PFSPs (MAEA-PFSPs) enables the agents to interact with their environment. With three designed behaviors, each agent increases energy as much as possible, so that MAEA-PFSPs find the optima. In the experiments, 29 benchmark PFSPs are used to compare with a GA-based algorithm, and good performance is obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carlier, J.: Ordonnancements a Contraintes Disjonctives. RAIRO. Operations Research 12, 333–351 (1978)
Heller, J.: Some Numerical Experiments for an M J Flow Shop and its Decision-Theoretical aspects. Operations Research 8, 178–184 (1960)
Reeves, C.R.: A Genetic Algorithm for Flowshop Sequencing. Computers and Operations Research 22(1), 5–13 (1995)
Wang, L.: Shop Scheduling with Genetic algorithms. Tsinghua University Press, Beijing (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, K., Li, J., Liu, J., Jiao, L. (2006). Permutation Flow-Shop Scheduling Based on Multiagent Evolutionary Algorithm. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_98
Download citation
DOI: https://doi.org/10.1007/11941439_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)