Evaluation on a Simulated Annealing based Model for Solving Job Shop Scheduling Problem
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 9, Issue 1
Abstract
The stochastic optimization techniques were commonly used in solving several optimization problems. There are different types of these algorithms that were addressed in several previous works. In our previous work, we implemented a GA and PSO based stochastic optimization model for solving the job shop scheduling problem (JSSP). The impacts of these two kinds of initial condition on the performance of these two algorithms were studied using the convergence curve and the achieved makespan. In this work we will implement a simulated annealing (SA) based model for solving JSSP. We will compare the performance of SA based method with the two other methods which we presented in our earlier works.
Authors and Affiliations
S Jayasankari
Keywords
Related Articles
- EP ID EP156774
- DOI -
- Views 76
- Downloads 0
Congestion Control: A Dynamic Approach
Abstract: Congestion control is a very important concept used in practical networks. Congestion of a networkoccurs when a network carries such high traffic of data that the quality of service deteriorates. In moder...
Image Restoration - A Survey
Abstract: Image restoration is the process of restoring the degraded or corrupted image back to its original form. It is the initial step of image processing. Noise is added in the image while sending an image from...
Experimental study of Web Page Ranking Algorithms
Today’s life is very much influenced by the internet. Everything can be accessed by making a search on the Internet. Web browsers and web search engines are the two major components of web searching. Web browsers are the...
Things on which a computer science engineer should focus on