Migrating Birds Optimization for Flow Shop Sequencing Problem

Vahit Tongur, Erkan Ülker

Computer Engineering Department, Necmettin Erbakan University, Konya, Turkey.
Computer Engineering Department, Sel?uk University, Konya, Turkey.

DOI: 10.4236/jcc.2014.24019                

Abstract

FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. Obtained results are compared with optimal results of related data sets.

Keywords

Migrating Birds Optimization; Flow Shop Sequencing Problem; Metaheuristic Optimization

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	Glover, F. and Kochenberger, G.A. (2003) Handbook of Metaheuristics. Kluwer Academic Publishers.
[2]	Duman, E., Uysal, M. and Alkaya, A.F. (2012) Migrating Birds Optimization: A New Metaheuristic Approach and Its Performance on Quadratic Assignment Problem. Information Sciences, 217, 65-77. http://dx.doi.org/10.1016/j.ins.2012.06.032
[3]	Ahuja, R.K., Ergun, O., Orlin, J.B. and Punnen, A.P. (2002) A Survey of Very Large Scale Neighborhood Search Techniques. Discrete Applied Mathematics, 123, 75-102. http://dx.doi.org/10.1016/j.ins.2012.06.032
[4]	Reeves, C.R. (1995) A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research, 22, 5-13. http://dx.doi.org/10.1016/0305-0548(93)E0014-K
[5]	Reeves, C.R. and Yamada, T. (1998) Genetic Algorithms, Path Relinking and the Flowshop Sequencing Problem. Evolutionary Computation Journal (MIT Press), 6, 230-234.
[6]	Armentano, V.A. and Ronconi, D.P. (1999) Tabu Search for Total Tardiness Minimization in Flowshop Scheduling Problems. Computers & Operations Research, 26, 219-235.
[7]	Ek?io?lu, B., Ek?io?lu, S.D. and Jain, P. (1998) A Tabu Search Algorithm for the Flowshop Scheduling Problem with Changing Neighborhoods. Computer & Industrial Engineering, 1-11.
[8]	Rajendran, C. and Ziegler, H. (2004) Ant-Colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs. European Journal of Operational Research, 155, 426-438.
[9]	Taillard, E. (1989) Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem.
[10]	Lissaman, P.B.S. and Shollenberger, C.A. (1970) Formation Flight of Birds. Science, 168, 1003-1005. http://dx.doi.org/10.1126/science.168.3934.1003
[11]	Burkard, R.E., ?ela, E., Karisch, S.E. and Rendl, F. (2010) QAPLIB Aquadratic Assignment Problem Library. http://www.opt.math.tugraz.ac.at/qaplib/
[12]	Taillard, E. (2013) Scheduling Instances. http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html