Parallel Computation Approaches to Optimize Learning Systems

• Autorzy: Czyż T. , Rudek R. , Selvaraj H.
• Języki publikacji: EN

Abstrakty

EN

This paper is devoted to the total tardiness minimization scheduling problem, where the efficiency of a processor increases due to its learning. Such problems model real-life settings that occur in the presence of a human learning (industry, manufacturing, management) and in some computer systems. However, the increasing growth of significant achievements in the field of artificial intelligence and machine learning is a premise that the human-like learning will be present in mechanized industrial processes that are controlled or performed by machines as well as in the greater number of multi-agent computer systems. Therefore, the optimization algorithms dedicated in this paper for scheduling problems with learning are not only the answer for present day scheduling problems (where human plays important role), but they are also a step forward to the improvement of self-learning and adapting systems that undeniably will occur in a new future. To solve the analysed problem, we propose parallel computation approaches that are based on NEH, tabu search and simulated annealing algorithms. The numerical analysis confirm high accuracy of these methods and show that the presented approaches significantly decrease running times of simulated annealing and tabu search and also reduce the running times of NEH.

Słowa kluczowe

EN

parallel computation; metaheuristic; scheduling; learning

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2011
• Tom: Vol. 57, No. 2
• Strony: 223--228
• Opis fizyczny: Bibliogr. 10 poz., wykr.

Twórcy

autor

Czyż T.

autor

Rudek R.

autor

Selvaraj H.

• Wrocław University of Technology, Janiszewskiego 11/18, 50-352 Wrocław, Poland,

Bibliografia

• [1] L. Buşoniu, R. Babuška, and B. De Schutter, “A comprehensive survey of multiagent reinforcement learning,” IEEE Transactions On Systems, Man, And Cybernetics - Part C: Applications And Reviews, vol. 38, pp. 156–172, 2008.
• [2] A. Grzech and P. Świątek, “Modeling and optimization of complex services in service-based systems,” Cybernetics and Systems, vol. 40, pp. 706–723, 2009.
• [3] D. Biskup, “A state-of-the-art review on scheduling with learning effects,” European Journal of Operational Research, vol. 188, pp. 315-329, 2008.
• [4] H. Kerzner, Project management: a system approach to planning, scheduling, and controlling. New York: John Wiley & Sons, Inc., 1998.
• [5] P. Świątek, A. Grzech, and P. Rygielski, “Adaptive packet scheduling for requests delay guaranties in packet-switched computer communication network,” Systems Science, vol. 36, pp. 7-12, 2010.
• [6] A. Janiak and R. Rudek, “A note on the learning effect in multi-agent optimization,” Expert Systems with Applications, vol. 38, pp. 5974-5980, 2011.
• [7] A. Janiak and R. Rudek, “Experience based approach to scheduling problems with the learning effect,” IEEE Transactions on Systems, Man, and Cybernetics - Part A, vol. 39, pp. 344–357, 2009.
• [8] M. Nawaz, J. E. E. Enscore, and I. A. Ham, “A heuristic algorithm for m-machine, n-jobs Flow-shop sequencing problem,” Omega, vol. 11, pp. 91–95, 1983.
• [9] F. Glover and M. Laguna, Tabu search. Norwell, MA: Kluwer, 1997.
• [10] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, 1983.