Pharmaceutical Chemistry Journal.
Vol. 53.
2019.
P. 6-14
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. © 2017 IEEE.
Authors
Diveev A.I.
1
,
Bobr O.V.
1
Conference proceedings
Publisher
Institute of Electrical and Electronics Engineers Inc.
Language
English
Status
Published
Number
8686990
Year
2019
Organizations
- 1 'Computer Science and Control', Russian Academy of Sciences, Peoples' Friendship University of Russia, RUDN University, Federal Research Center, Moscow, Russian Federation
Keywords
genetic algorithm; graph coloring algorithm; integer programming; simulated annealing method; simulation; University scheduling
Date of creation
19.07.2019
Date of change
24.05.2021
Share
Other records
11th IEEE International Conference on Application of Information and Communication Technologies, AICT 2017 - Proceedings.
Institute of Electrical and Electronics Engineers Inc..
2019.