Skip to main content

Research Repository

Advanced Search

A simulated annealing algorithm for multi-agent systems: A job-shop scheduling application

Aydin, M. Emin; Fogarty, Terence C.

Authors

Profile Image

Dr Mehmet Aydin Mehmet.Aydin@uwe.ac.uk
Senior Lecturer in Networks and Mobile Computing

Terence C. Fogarty



Abstract

In this paper, a parallel implementation of the modular simulated annealing algorithm for classical job-shop scheduling is presented. The implementation is for a multi agent system running on the distributed resource machine, which is a novel, scalable, distributed virtual machine based on Java technology. The problems tackled are well known, difficult benchmarks, widely used to measure the efficiency of metaheuristics with respect to both the quality of the solutions and the central processing unit time. The empirical results obtained show that the method proposed is successful in comparison with a sequential version of modular simulated annealing algorithm and other methods described in the literature.

Citation

Aydin, M. E., & Fogarty, T. C. (2004). A simulated annealing algorithm for multi-agent systems: A job-shop scheduling application. Journal of Intelligent Manufacturing, 15(6), 805-814. https://doi.org/10.1023/B%3AJIMS.0000042665.10086.cf

Journal Article Type Conference Paper
Publication Date Dec 1, 2004
Deposit Date May 6, 2021
Journal Journal of Intelligent Manufacturing
Print ISSN 0956-5515
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 15
Issue 6
Pages 805-814
DOI https://doi.org/10.1023/B%3AJIMS.0000042665.10086.cf
Public URL https://uwe-repository.worktribe.com/output/6545522