Agent-based approach to solving difficult scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4031 LNAI, Issue , 2006, Pages 24-33

  Jȩdrzejowicz, Joanna ^a   Jȩdrzejowicz, Piotr ^b  

^a UNIVERSITY OF GDA SK   (Poland)

^b GDYNIA MARITIME UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MULTI AGENT SYSTEMS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENTS; JOB-SHOP SCHEDULING;

PROBLEM SOLVING;

EID: 33746191298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

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), (2004), 465-462
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), (2004), 805-814
3. Czarnowski, L, Jȩdrzejowicz, P.: Application of the Parallel Population Learning Algorithm to Training Feed-forward ANN. In: P.Sincak (ed.) Intelligent Technologies - Theory and Applications, IOS Press, Amsterdam, (2002)10-16
4. Jȩdrzejowicz P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems, Foundation of Computing and Decision Sciences, 24 (1999) 51-66
5. Jȩdrzejowicz, J., Jedrzejowicz, P.: PLA-Based Permutation Scheduling, Foundations of Computing and Decision Sciences 28(3) (2003) 159-177
6. Jȩdrzejowicz, J., Jȩdrzejowicz, P.: New Upper Bounds for the Flowshop Scheduling Problem, In:M. All, F. Esposito (ed.)Innovations and Applied Artificial Intelligence, LNAI 3533 (2005),232-235
7. Kolonko, M.: Some new results on simulated annealing applied to job shop scheduling problem, European Journal of Operational Research, 113, (1999), 123-136.
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) (2000), 209-228
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 J.P. Muller et al. (Eds.): ATAL'98, LNAI 1555 (1999), pp. 261-276
10. Rajendran, Ch., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of Jobs, European Journal of Operational Research 1555(2004) 426-438.
11. Ruiz, R., Maroto, C., Alcaraz, J.: New Genetic Algorithms for the Permutation Flowshop Scheduling Problems, Proc. The Fifth Metaheuristic International Conference, Kyoto, (2003) 63-1-63-8
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, (1999) 515-522.
13. Talukdar, S., Baerentzen, L., Gave, A., de Souza, P.: Asynchronous Teams: Cooperation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18-59-96, Carnegie Mellon University, Pittsburgh, (1996)