NEW ALGORITHMS FOR SOLVING THE TASKS SCHEDULING PROBLEMS IN DISCRETE MANUFACTURING SYSTEMS

摘要

The new algorithms for solving the tasks scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated on the basis of the formulations of the problems for the other scheduling performance indices. The heuristic simulation annealing solution algorithm is presented. It is compared with the evolutionary solution algorithm using computer simulation experiments. The influence of the parameters of the solution algorithm as well as the tasks scheduling problem on the quality of results and on the time of computation is investigated.