Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm

Jabir Mumtaz, Guan Zailin, Jahanzaib Mirza, Mudassar Rauf, Shoaib Sarfraz, Essam Shehab

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Scheduling of jobs in Flow Shop (FS) is NP-hard problem which is usually solved by using heuristic and metaheuristic algorithms. In this paper modified Genetic Algorithm (GA) was used to solve FS scheduling problem to minimize the makespan. The proposed algorithm involved two improvements in GA. First is the modification in Roulette Wheel Selection (RWS) which is commonly used as a selection operator in GA. Secondly, the initialization of the population was created using NEH heuristic instead of random generation. The objective of these improvements in GA is to make smooth and fast convergence towards the best solution. A case study was conducted to evaluate the proposed algorithm using simulation. Experimental results demonstrated that the proposed algorithm can achieve a better solution with faster convergence as compared to GA with traditional RWS.

Original languageEnglish
Title of host publicationAdvances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research
EditorsKeith Case, Peter Thorvald
PublisherIOS Press BV
Pages435-440
Number of pages6
Volume8
ISBN (Electronic)9781614994398
DOIs
Publication statusPublished - Jan 1 2018
Externally publishedYes
Event16th International Conference on Manufacturing Research, ICMR 2018 - Skovde, Sweden
Duration: Sep 11 2018Sep 13 2018

Conference

Conference16th International Conference on Manufacturing Research, ICMR 2018
CountrySweden
CitySkovde
Period9/11/189/13/18

Fingerprint

Flow Shop Scheduling
Mathematical operators
Scheduling Problem
Genetic algorithms
Scheduling
Genetic Algorithm
Roulette
Operator
Wheel
Wheels
Heuristics
Random Generation
Flow Shop
NP-hard Problems
Initialization
Metaheuristics
Computational complexity
Flow shop scheduling
Genetic algorithm
Makespan

Keywords

  • Flow shop
  • Genetic algorithm
  • Makespan
  • Scheduling
  • Selection methods

ASJC Scopus subject areas

  • Computer Science Applications
  • Industrial and Manufacturing Engineering
  • Software
  • Algebra and Number Theory
  • Strategy and Management

Cite this

Mumtaz, J., Zailin, G., Mirza, J., Rauf, M., Sarfraz, S., & Shehab, E. (2018). Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. In K. Case, & P. Thorvald (Eds.), Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research (Vol. 8, pp. 435-440). IOS Press BV. https://doi.org/10.3233/978-1-61499-902-7-435

Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. / Mumtaz, Jabir; Zailin, Guan; Mirza, Jahanzaib; Rauf, Mudassar; Sarfraz, Shoaib; Shehab, Essam.

Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research. ed. / Keith Case; Peter Thorvald. Vol. 8 IOS Press BV, 2018. p. 435-440.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mumtaz, J, Zailin, G, Mirza, J, Rauf, M, Sarfraz, S & Shehab, E 2018, Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. in K Case & P Thorvald (eds), Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research. vol. 8, IOS Press BV, pp. 435-440, 16th International Conference on Manufacturing Research, ICMR 2018, Skovde, Sweden, 9/11/18. https://doi.org/10.3233/978-1-61499-902-7-435
Mumtaz J, Zailin G, Mirza J, Rauf M, Sarfraz S, Shehab E. Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. In Case K, Thorvald P, editors, Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research. Vol. 8. IOS Press BV. 2018. p. 435-440 https://doi.org/10.3233/978-1-61499-902-7-435
Mumtaz, Jabir ; Zailin, Guan ; Mirza, Jahanzaib ; Rauf, Mudassar ; Sarfraz, Shoaib ; Shehab, Essam. / Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research. editor / Keith Case ; Peter Thorvald. Vol. 8 IOS Press BV, 2018. pp. 435-440
@inproceedings{37a77610305c4a7a8303323993b90721,
title = "Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm",
abstract = "Scheduling of jobs in Flow Shop (FS) is NP-hard problem which is usually solved by using heuristic and metaheuristic algorithms. In this paper modified Genetic Algorithm (GA) was used to solve FS scheduling problem to minimize the makespan. The proposed algorithm involved two improvements in GA. First is the modification in Roulette Wheel Selection (RWS) which is commonly used as a selection operator in GA. Secondly, the initialization of the population was created using NEH heuristic instead of random generation. The objective of these improvements in GA is to make smooth and fast convergence towards the best solution. A case study was conducted to evaluate the proposed algorithm using simulation. Experimental results demonstrated that the proposed algorithm can achieve a better solution with faster convergence as compared to GA with traditional RWS.",
keywords = "Flow shop, Genetic algorithm, Makespan, Scheduling, Selection methods",
author = "Jabir Mumtaz and Guan Zailin and Jahanzaib Mirza and Mudassar Rauf and Shoaib Sarfraz and Essam Shehab",
year = "2018",
month = "1",
day = "1",
doi = "10.3233/978-1-61499-902-7-435",
language = "English",
volume = "8",
pages = "435--440",
editor = "Keith Case and Peter Thorvald",
booktitle = "Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research",
publisher = "IOS Press BV",

}

TY - GEN

T1 - Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm

AU - Mumtaz, Jabir

AU - Zailin, Guan

AU - Mirza, Jahanzaib

AU - Rauf, Mudassar

AU - Sarfraz, Shoaib

AU - Shehab, Essam

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Scheduling of jobs in Flow Shop (FS) is NP-hard problem which is usually solved by using heuristic and metaheuristic algorithms. In this paper modified Genetic Algorithm (GA) was used to solve FS scheduling problem to minimize the makespan. The proposed algorithm involved two improvements in GA. First is the modification in Roulette Wheel Selection (RWS) which is commonly used as a selection operator in GA. Secondly, the initialization of the population was created using NEH heuristic instead of random generation. The objective of these improvements in GA is to make smooth and fast convergence towards the best solution. A case study was conducted to evaluate the proposed algorithm using simulation. Experimental results demonstrated that the proposed algorithm can achieve a better solution with faster convergence as compared to GA with traditional RWS.

AB - Scheduling of jobs in Flow Shop (FS) is NP-hard problem which is usually solved by using heuristic and metaheuristic algorithms. In this paper modified Genetic Algorithm (GA) was used to solve FS scheduling problem to minimize the makespan. The proposed algorithm involved two improvements in GA. First is the modification in Roulette Wheel Selection (RWS) which is commonly used as a selection operator in GA. Secondly, the initialization of the population was created using NEH heuristic instead of random generation. The objective of these improvements in GA is to make smooth and fast convergence towards the best solution. A case study was conducted to evaluate the proposed algorithm using simulation. Experimental results demonstrated that the proposed algorithm can achieve a better solution with faster convergence as compared to GA with traditional RWS.

KW - Flow shop

KW - Genetic algorithm

KW - Makespan

KW - Scheduling

KW - Selection methods

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

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

U2 - 10.3233/978-1-61499-902-7-435

DO - 10.3233/978-1-61499-902-7-435

M3 - Conference contribution

VL - 8

SP - 435

EP - 440

BT - Advances in Manufacturing Technology XXXII - Proceedings of the 16th International Conference on Manufacturing Research, ICMR 2018, incorporating the 33rd National Conference on Manufacturing Research

A2 - Case, Keith

A2 - Thorvald, Peter

PB - IOS Press BV

ER -