NP-Hard Task Schedules and Methods of Its Decision

Methods of solving the problem of the schedule problem are examined, the advantages and disadvantages of these methods are identified, the formulation of the problem and modified genetic algorithm are given, which solutions with small variations of basic solution finds the optimal solution. The result of computational experiment is also given.