An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines
Abstract
In this article, an effective shuffled frog-leaping algorithm (SFLA) is proposed to solve the hybrid flow-shop scheduling problem with identical parallel machines (HFSP-IPM). First, some novel heuristic decoding rules for both job order decision and machine assignment are proposed. Then, three hybrid decoding schemes are designed to decode job order sequences to schedules. A special bi-level crossover and multiple local search operators are...
Paper Details
Title
An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines
Published Date
Dec 1, 2013
Journal
Volume
45
Issue
12
Pages
1409 - 1430
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History