An Improved Bat Algorithm and its Application in Permutation Flow Shop Scheduling Problem

Jian Jun Zhang; Yue Guang Li

doi:10.4028/www.scientific.net/AMR.1049-1050.1359

Paper Titles

Large-Sample Inference of EM Based on Maximum Likelihood Estimates
p.1343

Visual Plant Sticks Growth Model and Three-Dimensional Visualization
p.1347

Grey Modeling Method and its Application in Prediction of Aviation Safety Time Series
p.1351

Research on Prediction of CAAC Flight Incident 10000-Hour-Rate Based on Single Regression Model
p.1355

An Improved Bat Algorithm and its Application in Permutation Flow Shop Scheduling Problem
p.1359

An Improved Quantum Ant Colony Algorithm of Solving Nonlinear Equation Groups
p.1363

Cuckoo Search Algorithm for Solving Ill-Conditioned Linear Equations
p.1367

An Image Encryption Scheme Based on Generalized Arnold Map and Chinese Remainder Theorem
p.1371

Research on Cloud Computing Resources Provide Optimization Method
p.1375

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 1049-1050An Improved Bat Algorithm and its Application in...

An Improved Bat Algorithm and its Application in Permutation Flow Shop Scheduling Problem

Abstract:

Permutation flow shop scheduling problem is a complicated global optimum problem. In this paper, according to the characteristics of permutation flow shop scheduling problem, an improved bat algorithm was used to solve permutation flow shop scheduling problem. The algorithm was experimented and the experimental results show that the improved bat algorithm has better feasibility and validity for solving permutation flow shop scheduling problem.

You might also be interested in these eBooks

Modern Technologies in Materials, Mechanics and Intelligent Systems

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 1049-1050)

Pages:

1359-1362

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.1049-1050.1359

Citation:

Cite this paper

Online since:

October 2014

Authors:

Jian Jun Zhang*, Yue Guang Li

Keywords:

Bat Algorithm, Permutation Flow Shop Scheduling Problem, ROV

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

* - Corresponding Author

References

[1] Garey M R, Johnson D S, Sethi R. The complexity of floe shop and job shop scheduling[J]. Mathematics of operations research, 1976, 1(2): 117-129.

Google Scholar

[2] Low C, Yeh J Y, Huang K I. A robust simulated annealing heuristic for flow shop scheduling problems[J]. International Journal of Advanced Manufacturing Technology, 2004, 23: 762-767.

DOI: 10.1007/s00170-003-1687-x

Google Scholar

[3] Liu Yanfeng, Liu Sanyang. An Ant Colony Optimization for permutation flow shop scheduling[J]. Systems engineering and electronics, 2008, 30(9): 1690-1692.

DOI: 10.3724/sp.j.1087.2008.00302

Google Scholar

[4] Liu B, Wang L, Jin Y H. An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers[J]. computers&operations research, 2008, 35(9): 2791-2806.

DOI: 10.1016/j.cor.2006.12.013

Google Scholar

[5] Wang Ling, Liu bo. Particle swarm optimization and scheduling algorithm[M]. Beijing: Tsinghua University press, 2008: 115.

Google Scholar

[6] Xinshe Yang. A new meta heuristic bat-inspired Algorithm [J], Nature Inspired Cooperative Strategies for Optimization (NICSO2010)(Eds. J. R. Gonzalez et al. ), SCI 284, 2010: 65-74.

DOI: 10.1007/978-3-642-12538-6_6

Google Scholar

[7] Xinshe Yang. Bat algorithm for multi-objective optimization [J]. Bio-Inspired Computation, 2011, 3(5): 267-274.

Google Scholar

[8] Tasgetiren M F, Liang G Y, Sevkli M, et al. A particle swarm optimization algorithm for make span and total flow time minimization in the permutation flow shop sequencing problem[J]. European Journal of operational research, 2007, 177: 1930-(1947).

DOI: 10.1016/j.ejor.2005.12.024

Google Scholar

[9] Carlier J. Scheduling with disjunctive constraints[J]. Operation research, 1978, 12(4): 333-350.

Google Scholar