MULTIOBJECTIVE COMBINATORIAL PROBLEMS OPTIMIZATION USING METAHEURISTIC ALGORITHMS: LITERATURE SURVEY WITH THE CASE STUDY OF COURSE TIMETABLING AND MULTI JOB SHOP SCHEDULING PROBLEMS

Authors

  • M. Nandhini, S. Kanmani

Abstract

In this paper, common searching algorithms used for optimizing soft constrained multi objective combinatorial problems have been surveyed with the case study of course timetabling problem and multi job shop scheduling problem over the period of 30 to 40 years.

Article Metrics Graph

Chart Graph | Range Graph

Downloads

Published

2013-10-13

Issue

Vol. 2 No. 11 (2012): Asian Journal of Computer Science and Information Technology

Section

Articles

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”