Hybrid solution algorithms for task scheduling problem with moving executors

Authors:
Jerzy Józefczyk
Affiliations:
Systems Research Institute of Polish Academy of Sciences, Laboratory of Knowledge Systems and Artificial Intelligence, Podwale St. 75, 50-449 Wroclaw, Poland
Venue:
Engineering Applications of Artificial Intelligence
Year:
2006

Citing 9
Cited 0

A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation

Computers and Industrial Engineering
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
A Simple Heuristic for M-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Operations Research
A new model of simulated evolutionary computation-convergenceanalysis and specifications

IEEE Transactions on Evolutionary Computation
Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.