Neural Network for Solving Job-Shop Scheduling Problem
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 6
Abstract
Abstract: The job shop scheduling is a very important scheduling problem, which is NP-complete in the strongsense and with well-known benchmark instances of relatively small size, which attest the practical difficulty insolving. Artificial neural network models have been successfully applied to solve such a job-shop schedulingproblem (JSSP) known as a Nonpolynomial (NP-complete) constraint satisfaction problem. Our maincontribution is an improvement of the algorithm proposed in the literature, which consists optimization of initialvalue of starting time. The main objective is to minimize the total weighted completion time of the jobs in thesystem that is the minimization of the makespan time by using the heuristic method. In this study, the heuristic method is used which gives a high quality approximate solution in reasonable time. The main advantage ofusing Hopfield Neural Network (HNN) is to improve the searching speed for getting an optimal or near optimalsolution of a deterministic JSSP for reducing the makespan time. The simulation of the proposed method hasbeen performed on various benchmarks. For two jobs and three machines (2/3/J/Cmax) dataset problem andany dataset problems, the simulation results shows the efficient with respect to the resolution speed, quality ofthe solution, and the reduction of the computation time which was not solved by Fanaiech et al. So, thesimulation results have revealed that proposed heuristic algorithm can find high quality solutions to large sizedinstances very quickly
Authors and Affiliations
Miss. Rukhsana G. Sache
Keywords
Related Articles
- EP ID EP110953
- DOI -
- Views 97
- Downloads 0
Exponential software reliability using SPRT: MLE
In Classical Hypothesis testing volumes of data is to be collected and then the conclusions are drawn, which may need more time. But, Sequential Analysis of Statistical science could be adopted in order to ...
Robust Digital Image Watermarking based on spread spectrum and convolutional coding
Digital watermarking is a promising technology to embed information as unperceivable signals in digital contents. A copyright protection method for digital image with convolutional coding is proposed in this &nbs...
Novel Hybrid k-D-Apriori Algorithm for Web Usage Mining
Abstract: The Web usage mining is a branch of web mining in which by clustering the datasets, frequently accessed patterns can be obtained for betterment of social portals, websites. The divisive analysis is one of the t...
Password-oriented Image Encryption with multiple dependent factors.
Abstract: The goal of this project was to develop a password-based image encryption algorithm that would be virtually safe from brute-force attacks, resulting in an image that would have no recognizable pattern. Th...
A Study of Two Different Attacks to IPv6 Network
In the lights of today and future advancing technologies, the demand of IPv6 internet protocol, had becomes crucial for its usages & benefits. This paper investigates the use of information messages to build a visual per...