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

 Mining Conceptual Relations from Textual Web Content Using Leximancer

 Abstract: Concept mining is a process that focuses on extracting ideas and concepts found in documents. The approach is somewhat similar to text mining, with the main difference being that mining a text focuses on...

Novel Approach For Isolated Left Endobronchial Intubation With Single Lumen Tube In Paediatric Patients

Background: Right thoracoscopy requires selective left endobronchial intubation which is technically difficult and demanding. We are presenting our experience of selective left bronchus intubation without any guidance,us...

 Filtering Unwanted Messages from Online Social Networks (OSN) using Rule Based Technique

 Online Social Networks (OSNs) are today one of the most popular interactive medium to share, communicate, and distribute a significant amount of human life information. In OSNs, information filtering can  a...

 A Close Approach to Iris Recognition System

 Abstract: Iris recognition, a relatively new biometric technology, has great advantages such as variability, stability and security, thus it is the most promising for high security environments. Among its applicati...

 Stegnography in video files using Multivariate Regression and Flexible Macroblock Ordering

Abstract: Data hiding is the ability of embedding data into a digital cover with a minimum amount of perceivable degradation, i.e., the embedded data is invisible or inaudible to a human observer. Data hiding consists of...

Download PDF file
  • EP ID EP110953
  • DOI -
  • Views 71
  • Downloads 0

How To Cite

Miss. Rukhsana G. Sache (2014).  Neural Network for Solving Job-Shop Scheduling Problem. IOSR Journals (IOSR Journal of Computer Engineering), 16(6), 18-25. https://europub.co.uk/articles/-A-110953