Description
Title: FLEXIBLE JOB-SHOP SCHEDULING PROBLEM SOLVED BY META-HEURISTIC APPROACH BASED ON GENETIC AND GREEDY ALGORITHMS
Paper Quality: SCOPUS / Web of Science Level Research Paper
Paper type: Analysis Based Research Paper
Subject: Computer Science
Writer Experience: 20+ Years
Turnitin Plagiarism Report will be less than 10%
Restriction: Only one author may purchase a single paper. The paper will then indicate that it is out of stock.
What will I get after the purchase?
A turnitin plagiarism report of less than 10% in a pdf file and a full research paper in a word document.
Abstract: Job-shop scheduling systems are one of the applications of group technology
in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.
Keywords: job-shop scheduling, meta-heuristic method, genetic algorithm,
greedy algorithm, jobs priority
In case you have any questions related to this research paper, please feel free to call/ WhatsApp on +919726999915
Reviews
There are no reviews yet.