Open AccessA Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling
Author(s) -
Kun Wang,
Lingfeng Xu,
Cong Lv
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1314/1/012126
Subject(s) - tardiness , job shop scheduling , flow shop scheduling , lexicographical order , mathematical optimization , computer science , crossover , scheduling (production processes) , operator (biology) , mathematics , artificial intelligence , schedule , biochemistry , chemistry , repressor , combinatorics , transcription factor , gene , operating system
In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator is introduced. During the searching process of memeplex, instead of worst solution, multiple best solutions are used to generate new solutions. Further with that, the process of generating random solution is replaced with the neighborhood search. Then as indicated by the simulation based on a group of instances, the novel SFLA is superior in addressing hybrid flow shop scheduling problem.