Next Article in Journal / Special Issue
An Efficient SAR Image Segmentation Framework Using Transformed Nonlocal Mean and Multi-Objective Clustering in Kernel Space
Previous Article in Journal
Networked Control System Time-Delay Compensation Based on Time-Delay Prediction and Improved Implicit GPC
Previous Article in Special Issue
The Lobe Fissure Tracking by the Modified Ant Colony Optimization Framework in CT Images
Article Menu

Export Article

Open AccessArticle
Algorithms 2015, 8(1), 19-31; doi:10.3390/a8010019

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

1
Transportation Management College, Dalian Maritime University, Dalian 116026, China
2
Department of transportation Engineering, Indian Institute of Technology, Kharagpur 721302, India
3
Traffic and transportation college, Beijing Jiaotong University, Beijing 100044, China
*
Author to whom correspondence should be addressed.
Academic Editor: Chen-Chung Liu
Received: 24 October 2014 / Revised: 26 December 2014 / Accepted: 15 January 2015 / Published: 4 February 2015
(This article belongs to the Special Issue Advanced Data Processing Algorithms in Engineering)
View Full-Text   |   Download PDF [343 KB, uploaded 4 February 2015]   |  

Abstract

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 an extremal optimization in information exchange. The computational result shows that the proposed algorithm has a powerful search capability in solving the flexible job shop scheduling problem compared with other heuristic algorithms, such as the genetic algorithm, tabu search and ant colony optimization. Moreover, the results also show that the improved strategies could improve the performance of the algorithm effectively. View Full-Text
Keywords: shuffled frog-leaping algorithm; flexible job shop scheduling problem; local search; extremal optimization shuffled frog-leaping algorithm; flexible job shop scheduling problem; local search; extremal optimization
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Lu, K.; Ting, L.; Keming, W.; Hanbing, Z.; Makoto, T.; Bin, Y. An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem. Algorithms 2015, 8, 19-31.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top