Agent-Based Approach to Solving Difficult Scheduling Problems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4031)


The paper proposes a variant of the A-Team architecture called PLA-Team. An A-Team is a problem solving architecture in which the agents are autonomous and co-operate by modifying one another’s trial solutions. A PLA-Team differs from other A-Teams with respect to strategy of generating and destroying solutions kept in the common memory. The proposed PLA-Team performance is evaluated basing on computational experiments involving benchmark instances of two well known combinatorial optimization problems – flow shop and job-shop scheduling. Solutions generated by the PLA-Team are compared with those produced by state-of-the-arts algorithms.


Schedule Problem Simulated Annealing Tabu Search Hybrid Genetic Algorithm Tabu Search Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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 (2004)CrossRefGoogle Scholar
  3. 3.
    Czarnowski, I., Jędrzejowicz, P.: Application of the Parallel Population Learning Algorithm to Training Feed-forward ANN. In: Sincak, P. (ed.) Intelligent Technologies - Theory and Applications, pp. 10–16. IOS Press, Amsterdam (2002)Google Scholar
  4. 4.
    Jędrzejowicz, P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems. Foundation of Computing and Decision Sciences 24, 51–66 (1999)zbMATHGoogle Scholar
  5. 5.
    Jędrzejowicz, J., Jędrzejowicz, P.: PLA-Based Permutation Scheduling. Foundations of Computing and Decision Sciences 28(3), 159–177 (2003)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Jędrzejowicz, J., Jędrzejowicz, P.: New Upper Bounds for the Flowshop Scheduling Problem. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS, vol. 3533, pp. 232–235. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Kolonko, M.: Some new results on simulated annealing applied to job shop scheduling problem. European Journal of Operational Research 113, 123–136 (1999)CrossRefzbMATHGoogle Scholar
  8. 8.
    Parunak, H.V.D.: Agents in Overalls: Experiences and Issues in the Development and Deployment of Industrial Agent-Based Systems. Intern. J. of Cooperative Information Systems 9(3), 209–228 (2000)CrossRefGoogle Scholar
  9. 9.
    Rachlin, J., Goodwin, R., Murthy, S., Akkiraju, R., Wu, F., Kumaran, S., Das, R.: A-Teams: An Agent Architecture for Optimization and Decision-Support. In: Rao, A.S., Singh, M.P., Müller, J.P. (eds.) ATAL 1998. LNCS, vol. 1555, pp. 261–276. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  10. 10.
    Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 1555, 426–438 (2004)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Ruiz, R., Maroto, C., Alcaraz, J.: New Genetic Algorithms for the Permutation Flowshop Scheduling Problems. In: Proc. The Fifth Metaheuristic International Conference, Kyoto, pp. 63-1–63-8 (2003)Google Scholar
  12. 12.
    Satake, T., Morikawa, K., Takahashi, K., Nakamura, N.: Simulated annealing approach for minimizing the makespan of the general job-shop. International Journal of Production Economics 60(61), 515–522 (1999)CrossRefGoogle Scholar
  13. 13.
    Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18-59-96, Carnegie Mellon University, Pittsburgh (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Institute of MathematicsGdańsk UniversityGdańskPoland
  2. 2.Department of Information SystemsGdynia Maritime UniversityGdyniaPoland

Personalised recommendations