Scheduling of tasks on moving executors using advanced evolutionary algorithms

• Autorzy: Józefczyk J.
• Języki publikacji: EN

Abstrakty

EN

The paper concerns the application of advanced evolutionary algorithms for solving a complex scheduling problem of manufacturing tasks. The case of scheduling of independent, non-preemptive tasks on unrelated moving executors, to minimize the makespan is considered. New heuristic solution algorithms based on an evolutionary computation are proposed. They use three different ways of multiple crossovers. The computer simulation experiments have been performed to investigate the dependence of results of the tasks scheduling on parameters of evolutionary algorithms as well as the quality of the solution algorithms in terms of the makespan and the time of computation. The evolutionary algorithms have been compared with a traditional solution algorithm that has been determined using the functional decomposition of the problem. A numerical example together with conclusions completes the paper.

Słowa kluczowe

EN

scheduling; manufacture; computation theory; evolutionary algorithms; decision theory; iterative methods; computer simulation

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2003
• Tom: Vol. 29, nr 3
• Strony: 95--106
• Opis fizyczny: Bibliogr. 11 poz.,

Twórcy

autor

Józefczyk J.

• Institut of Control Systems Engineering, Wroclaw University of Technology, 50-370 Wroclaw, Poland

Bibliografia

• [1] Esquivel S. С., Gatica C. R., Gallard R„ Alternative recombination methods in evolution algorithms for the task scheduling problem, Proc. of In. I ICSC Symposium on Soft Сотрщ. SOCO '2001, Paisley, Scotland (2001).
• [2] Esquivel S. C., Ferrero S., Gallard R., Salto R.C., Alfonso H„ Schutz M., Enhanced evolutionary algorithms for single and multiobjective optimization in the job-shop scheduling problem, Knowledge-Based Systems, 15, 2002, 13-25.
• [3] Józefczyk J., Tasks scheduling on moving executors in complex operation systems, Wroclaw Dr. versity of Technology Press, Wroclaw 1996, (in Polish).
• [4] Józefczyk J., An algorithm for scheduling tasks on moving executors in complex operation system Proc. of 1st IFAC Workshop on Manufacturing Systems MIM'97, Wien, Austria, 1997, 139-144.
• [5] Józefczyk J., On the problem of scheduling tasks on moving executors with random processing times, Systems Science, 25, 1999, 5-13.
• [6] Józefczyk J., Scheduling of manufacturing tasks with uncertain processing times, Proc. of 14ihl; Conf. on Systems Engineering, 1, Coventry 2000, 294-299.
• [7] Józefczyk J., Scheduling tasks on moving executors to minimise the maximum lateness, Europe Journal of Operational Research, 131, 2001, 171-187.
• [8] Józefczyk J., Application of genetic algorithms for solving the scheduling problem with moving executors, Systems Science, 27, 2001, 87-95.
• [9] Józefczyk J., Solving of the scheduling problem with moving executors using advanced gene: algorithms, Proc. of 3rd Symposium Al Meth, Gliwice, Poland, 2002, 205-208.
• [10] Józefczyk J., On the application of evolutionary algorithms with multiple crossovers for solving the task scheduling problem, Proc. of IASTED Int. Conf. on Intelligent Systems and Control, Salzburg Austria, 2003, (in press).
• [11] Raffs S. J. (ed), Routing and scheduling of vehicles and crews: the state of the art, International Journal Computers and Operation Research, 10, 1983, 63-211.