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 78
- Downloads 0
Mining Top-k Closed Sequential Patterns in Sequential Databases
In data mining community, sequential pattern mining has been studied extensively. Most studies require the specification of minimum support threshold to mine the sequential patterns. However, it is difficult &nbs...
Blueprint on Comparison of WSN Protocols
Abstract: A sensor network is a group of specialized devices that converts energy of one form into another that also designed to monitor and record condition at places of different areas. Commonly monitored parameters ar...
K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations
Data mining refers to the process of analyzing the data from different perspectives and summarizing it into useful information that is mostly used by the different users for analyzing the data as well as for p...
Segmentation of Tumor Region from Brain Mri Images Using Fuzzy C-Means Clustering And Seeded Region Growing
Abstract: The detection of brain tumor is one of the most challenging tasks in the field of medical image processing, since brain images are very complicated and tumors can be analyzed efficiently only by the expert radi...
Analysis of Binpacking
The main objective of this problem is to pack objects of fixed volume into bins, each of them having a maximum capacity, so as to minimize the total number of bins used. Binpacking is an Np-complete problem as the...