A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2019-10, Vol.1314 (1), p.12126
Main Authors: Wang, Kun, Xu, Lamei, Lv, Cong
Format: Article
Language:English
Subjects:
Algorithms
Job shop scheduling
Job shops
Physics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1314/1/012126