Hybrid solution algorithms for task scheduling problem with moving executors

Heuristic algorithms for solving the task scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated. Three hybrid solution algorithms are introduced. As a basis an evolutionary algorithm is assu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Engineering applications of artificial intelligence Ročník 19; číslo 2; s. 135 - 143
Hlavný autor:	Józefczyk, Jerzy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.03.2006
Predmet:	Artificial intelligence Flexible manufacturing systems Scheduling algorithms Artificial intelligence Flexible manufacturing systems Scheduling algorithms
ISSN:	0952-1976, 1873-6769
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	Heuristic algorithms for solving the task scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated. Three hybrid solution algorithms are introduced. As a basis an evolutionary algorithm is assumed that is combined with the procedure that uses simulated annealing metaheuristics. The results of simulation experiments are given in which the influence of parameters of the solution algorithms as well as of the number of tasks on the quality of scheduling and on the time of computation is investigated.
ISSN:	0952-1976 1873-6769
DOI:	10.1016/j.engappai.2005.08.001