Abstract
This paper addresses and introduces an overview on various multi-agent architectures applied to teams of metaheuristic agents for job shop scheduling applications, whose developed and examined on distributed problem solving environments. We reported a couple of topologies; ATEAM is a centrally coordinating method, which provides very good results when well-studied, on the other hand, architectures based on peer-to-peer technology provide wider flexibility in implementing various fashions. The experimentation for each targeted topology has revealed more details and attracts more attentions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aydin, M.E., Fogarty, T.C.: A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. Journal of Heuristics 10(3), 269–292 (2004)
Aydin, M.E., Fogarty, T.C.: Teams of autonomous agents for job-shop scheduling problems: An experimental study. Journal of Intelligent Manufacturing 15(4), 455–462 (2004)
Aydin, M.E., Fogarty, T.C.: A simulated annealing algorithm for multi-agent systems: a job shop scheduling application. Journal of Intelligent Manufacturing 15(6), 805–814 (2002)
Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with Path-Relinking for Job Shop Scheduling. Parallel Computing 29, 393–430 (2003)
Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Son, Chichester (1974)
Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms 3, 285–308 (2004)
Goncalves, J.F., Mendes, J.M., Resende, M.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operations Research 167(1), 77–95 (2004)
Jelasity, M., Preuβ, M., Peachter B.: A scalable and robust framework for distributed applications, CEC’02: The 2002 World Congress on Computational Intelligence, Honolulu, HI, U.S.A. (May 12-17, 2002)
Crainic, T.G., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative Parallel Variable Neighborhood Search for the p-Median. Journal of Heuristics 10, 293–314 (2004)
Garcia-Lopez, F., Melian-Batista, B., Moreno-Perez, J.A., Moreno-Vega, M.: The parallel variable neighbourhood Search for the p-Median Problem. Journal of Heuristics 8, 375–388 (2002)
Peachter, B., Back, T., Schoenauer, M., Sebag, M., Eiben, A.E., Merelo, J.J., Fogarty, T.C.: A distributed resource evolutionary algorithm machine (DREAM). In: Proc. of the Congress of Evolutionary Computation 2000 (CEC200), IEEE, pp. 951–958. IEEE Press, Los Alamitos (2000)
Satake, T., Morikawa, K., Takahashi, K., Nakamura, N.: Simulated annealing approach for minimising the makespan of the general job-shop. International Journal of Production Economics, 60–61, 515–522 (1999)
Talukdar, S.: Asynchronous teams. In: Proc. of 4th International Symposium on Expert Systems Applications in Power Systems, LaTrobe University, Melbourne, Australia (1993)
Hammami, M., Ghediera, K.: COSATS, X-COSATS: Two multi-agent systems cooperating simulated annealing, tabu search and X-over operator for the K-Graph Partitioning problem. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 647–653. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aydin, M.E. (2007). Metaheuristic Agent Teams for Job Shop Scheduling Problems. In: Mařík, V., Vyatkin, V., Colombo, A.W. (eds) Holonic and Multi-Agent Systems for Manufacturing. HoloMAS 2007. Lecture Notes in Computer Science(), vol 4659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74481-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74481-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74478-8
Online ISBN: 978-3-540-74481-8
eBook Packages: Computer ScienceComputer Science (R0)