| Abstract [eng] |
The purpose of this work is to analyze the scheduling problem as well as optimality criteria’s which is used in it. To realize it in program and do the comparable analyze for optimality criteria. In this work it was used Simulated Annealing, Tabu-search and Genetic algorithm methods. Also, it was used these three optimality criteria’s: Makespan, Maximum Lateness and Total weighted completion time. To realize it in programmable way, I used C++ builder program. I chosen this program because of its advantages: variety of its solving problems, very good interface, ability to write arithmetic and logical functions and so on. |
