An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and...

Full description

Bibliographic Details
Main Authors: Kong Lu, Li Ting, Wang Keming, Zhu Hanbing, Takano Makoto, Yu Bin
Format: Article
Language:English
Published: MDPI AG 2015-02-01
Series:Algorithms
Subjects:
shuffled frog-leaping algorithm
flexible job shop scheduling problem
local search
extremal optimization
Online Access:http://www.mdpi.com/1999-4893/8/1/19

Similar Items

Similar Items