Notice of Violation of IEEE Publication Principles: Enhancement of jobshop scheduling problem using search optimization

Abstract

Notice of Violation of IEEE Publication Principles<br><br>"Enhancement of Jobshop Scheduling Problem Using Search Optimization"<br>by Vinay P. Viradia, Chintan M. Bhatt<br>in the Proceedings of the Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP), May 2014, pp. 411-414<br><br>After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE’s Publication Principles.<br><br>This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.<br><br>Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:<br><br>"Enhancement of Jobshop Scheduling Problem Using Search Optimization"<br>by Sneha A. Gaywala<br>in the Proceedings of the Second National Conference on Innovative and Emerging Technologies (NCIET), January 2014, pp. 81-83<br><br> <br/> Jobshop scheduling is a most difficult problem, both theoretically and practically. It is classified as NP-Hard Problem. Nature Inspired (or bio-inspired) Algorithms is a new age in layering spacious series of applications and solution to different optimization problems. These algorithms are known as clever algorithms. Job shop scheduling is a problem of constrained optimization and it is most universal and complex problem among all shop scheduling problems Nature inspired algorithms and approximation algorithms seem to be very effective in giving near optimal solutions to such complex problems. In this paper, the concept of the cuckoo search (CS) algorithm (metaheuristic approach to solve structural optimization problems) is elaborated and estimate the approach that cuckoo search optimization algorithm can perform more efficiently. This paper is also trying to give the better approach of reducing makespan of jobshop benchmark problems.