|
BRIEF SURVEY OF OPTIMIZATION TECHNIQUES FOR MULTIPROCESSORS TASKS SCHEDULING PROBLEMS
1
Author(s):
JUGMENDRA SINGH
Vol - 7, Issue- 1 ,
Page(s) : 105 - 112
(2016 )
DOI : https://doi.org/10.32804/IRJMST
Abstract
Multiprocessors Tasks Scheduling Problem (MTSP) is a NP hard problem and MTSP is the most intensively studied problem in the wide area of optimization. There are a number of approximation algorithms and heuristics proposed in the literature which can yield to good solutions. But with the increase in the number of multiprocessors tasks, the complexity of the problem goes on increasing.
- Chetan Chudasama, S. M. Shah and Mahesh Panchal, “Comparison of Parents Selection Methods of Genetic Algorithm for TSP”, International Conference on Computer Communication and Networks (CSI- COMNET), 2011.
- Varshika Dwivedi, Taruna Chauhan, Sanu Saxena and Princie Agrawal, “Travelling Salesman Problem using Genetic Algorithm”, International Journal of Computer Applications(IJCA), 2012, pp. 25-30.
- Naveen kumar, Karambir and Rajiv Kumar, “A Genetic Algorithm Approach To Study Travelling Salesman Problem”, Journal of Global Research in Computer Science, 2012, Vol. 3, No. (3).
- Adewole Philip, Akinwale Adio Taofiki and Otunbanowo Kehinde, “A Genetic Algorithm for Solving Travelling Salesman Problem”, International Journal of Advanced Computer Science and Applications, 2011, Vol. (2), No. (1).
- Buthainah Fahran, Al-Dulaimi, and Hamza A. Ali, “Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)”, World Academy of Science, Engineering and Technology, 2008, Vol. (14).
- Milena Karova, Vassil Smarkov and Stoyan Penev, “Genetic operator’s crossover and mutation in solving the TSP probem”, International Conference on Computer Systems and Technologies (CompSysTech), 2005.
- Alka Singh Bhagel and Ritesh Rastogi, “Effective Approaches for Solving Large Travelling Salesman Problems with Small Populations”, International Journal of Advances in Engineering Research (IJAER), 2011, Vol. (1), Issue (1).
- Ivan Brezina Jr. Zuzana and Cickova, “Solving the Travelling Salesman Problem using the Ant colony Optimization”, Management Information Systems, 2011, Vol. (6), No. (4).
- DING Chao, CHENG Ye and H E Miao, “Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSP’s”, Tsinghua Science and Technology, August 2007, pp. 459-465 Vol. (12), No. (4).
- Huilian FAN, “Discrete Particle Swarm Optimization for TSP based on Neighbourhood”, Journal of Computational Information Systems, 2010, pp. 3407-3414.
- Lawrence V. Snyder and Mark S. Daskin, “A random-key genetic algorithm for the generalized travelling salesman problem”, European Journal of Operational Research, 2006, pp. 38–53.
- Plamenka Borovska, “Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster”, International Conference on Computer Systems and Technologies (CompSysTech’06), 2006.
- Zakir H. Ahmed, “Genetic Algorithm for the Traveling Salesman Problem using Sequential Constructive Crossover Operator”, International Journal of Biometrics & Bioinformatics (IJBB) Vol. (3), Issue (6).
- Yang T, Gerasoulis A. DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems 1994;5(9).
- Correa RC, Ferreira A, Rebreyend P. Scheduling multiprocessor tasks with genetic algorithms. IEEE Transactions on Parallel and Distributed Systems 1999;10(8):825–37.
|