![]() |
|
written by Anatole A. Klyosov, Igor L. Rozhanskii,
published by Intelligent Information Management, Vol.2 No.7, 2010
has been cited by the following article(s):
[1]
Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
XVIII Congreso Argentino de Ciencias de la Computación
2012
[2]
A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
XVIII Congreso Argentino de Ciencias de la Computación
2013
[3]
Assesing The Performance of Di?erent S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem
Revista Iberoamericana de Inteligencia Artificial
2013
[4]
Assesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem
Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial
2013
[5]
Implementation of Greedy and Simulated Annealing Algorithms for Wireless Access Point Placement
2015
[6]
An Overview of the Extended Neighborhood Search Techniques for Shop Scheduling Problems
2013
[8]
A Simulated Annealing Based Optimization Algorithm
Computational Optimization In Engineering Paradigms And Applications
2017
[9]
116,000 125M
2017
[10]
Flowshop scheduling problem with parallel semi-lines and final synchronization operation
2019