Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems

Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical Job Shop Scheduling Problem (JSSP). The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive...

Full description

Saved in:
Bibliographic Details
Published inMathematical problems in engineering Vol. 2018; no. 2018; pp. 1 - 32
Main Authors Asgher, Umer, Zhang, Faping, Agha, Mujtaba Hassan, Ahmad, Riaz, Kousar, Rubeena, Butt, Shahid Ikramullah, Amjad, Muhammad Kamal, Anjum, Naveed
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2018
Hindawi
Hindawi Limited
Subjects
Engineering
Genetic algorithms
Job shop scheduling
Job shops
Literature reviews
Manufacturing
Production scheduling
Online AccessGet full text

Cover

More Information
Summary:Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical Job Shop Scheduling Problem (JSSP). The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive research has been carried out in this area especially over the span of the last 20 years in which the hybrid approaches involving Genetic Algorithm (GA) have gained the most popularity. Keeping in view this aspect, this article presents a comprehensive literature review of the FJSSPs solved using the GA. The survey is further extended by the inclusion of the hybrid GA (hGA) techniques used in the solution of the problem. This review will give readers an insight into use of certain parameters in their future research along with future research directions.
ISSN:1024-123X
1563-5147
DOI:10.1155/2018/9270802