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

Muhammad Kamal Amjad; Shahid Ikramullah Butt; Rubeena Kousar; Riaz Ahmad; Mujtaba Hassan Agha; Zhang Faping; Naveed Anjum; Umer Asgher

doi:10.1155/2018/9270802

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

Muhammad Kamal Amjad^*, Shahid Ikramullah Butt, Rubeena Kousar, Riaz Ahmad, Mujtaba Hassan Agha, Zhang Faping, Naveed Anjum, Umer Asgher

^*Awdur cyfatebol y gwaith hwn

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl adolygu › adolygiad gan gymheiriaid

113 Dyfyniadau (Scopus)

Crynodeb

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.

Iaith wreiddiol	Saesneg
Rhif yr erthygl	9270802
Cyfnodolyn	Mathematical Problems in Engineering
Cyfrol	2018
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1155/2018/9270802
Statws	Cyhoeddwyd - 28 Chwef 2018
Cyhoeddwyd yn allanol	Ie

Mynediad at Ddogfen

10.1155/2018/9270802

Ffeiliau eraill a chysylltiadau

Dolen i’r cyhoeddiad yn Scopus

Dyfynnu hyn

@article{01e86266f8d34e65b17e207aa2abf52c,

title = "Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems",

abstract = "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.",

author = "Amjad, {Muhammad Kamal} and Butt, {Shahid Ikramullah} and Rubeena Kousar and Riaz Ahmad and Agha, {Mujtaba Hassan} and Zhang Faping and Naveed Anjum and Umer Asgher",

note = "Publisher Copyright: {\textcopyright} 2018 Muhammad Kamal Amjad et al.",

year = "2018",

month = feb,

day = "28",

doi = "10.1155/2018/9270802",

language = "English",

volume = "2018",

journal = "Mathematical Problems in Engineering",

issn = "1024-123X",

}

TY - JOUR

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

AU - Amjad, Muhammad Kamal

AU - Butt, Shahid Ikramullah

AU - Kousar, Rubeena

AU - Ahmad, Riaz

AU - Agha, Mujtaba Hassan

AU - Faping, Zhang

AU - Anjum, Naveed

AU - Asgher, Umer

PY - 2018/2/28

Y1 - 2018/2/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85044097580&partnerID=8YFLogxK

U2 - 10.1155/2018/9270802

DO - 10.1155/2018/9270802

M3 - Review article

AN - SCOPUS:85044097580

SN - 1024-123X

VL - 2018

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

M1 - 9270802

ER -