Application of Genetic Algorithm on Job Shop Scheduling Problem to Minimise Makespan
Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 6)Publication Date: 2016-06-05
Authors : Anshulika; L. A. Bewoor;
Page : 1726-1729
Keywords : Job shop scheduling JSS; Genetic Algorithm GA; metaheuristic; optimization;
Abstract
Scheduling of large number of jobs/tasks is a tedious and time taking work. With the increase is demand of products, the manufacturing industries have been facing a lot of trouble in fulfilling those demands while optimizing the production. Job shop scheduling problem (JSSP) is a well known combinatorial optimization problem with NP hard difficulty. Job shop scheduling (JSS) is the efficient allocation of shared resources (M) to competing jobs (J) such that a specific optimization criterion is satisfied. The complexity of JSS is (J!) ^M, which makes it NH hard. Various techniques have been used to solve the JSS problem till date. Metaheuristic techniques like Genetic Algorithm (GA) have shown good results and have been proven to be better performers than other techniques.
Other Latest Articles
- A Novel Bag-of-Object Retrieval Model To Predict Image Relevance
- Application of Katharine Kolcaba Comfort Theory in Post Operative Child: Delivering Integrative Comfort Care Intervention by using Theory of Comfort ?A Case Study of a 5 year Old Child Admitted in PICU with Laprotomy Experiencing Post Operative Discomfort
- Rider: A Multi Layer Framework for Road Condition Estimation
- An Approach for Securing Data in e-Governance Projects in Developing Countries
- Accuracy of Panoramic Radiography for Detection of Periapical Endodontic Lesions
Last modified: 2021-07-01 14:39:08