Abstract
Being a typical NP-hard combinatorial optimization problem, the hybrid flow shop (HFS) problem widely exists in manufacturing systems. In this paper, we firstly establish the model of the HFS problem by employing the vector representation. Then an improved discrete artificial bee colony (IDABC) algorithm is proposed for this problem to minimize the makespan. In the IDABC algorithm, a novel differential evolution and a modified variable neighborhood search are studied to generating new solutions for the employed and onlooker bees. The destruction and construction procedures are utilized to obtain solutions for the scout bees. The simulation results clearly imply that the proposed IDABC algorithm is highly effective and efficient as compared to six state-of-the-art algorithms on the same benchmark instances.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Pinedo, M.: Scheduling: theory algorithms and systems. Prentice-Hall, Englewood Cliffs (2002)
Gupta, J.N.D.: Two-stage hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39, 359–364 (1988)
Santos, D.L., Hunsucker, J.L., Deal, D.E.: Global lower bounds for flow shops with multiple processors. Eur. J. Oper. Res. 80(1), 112–120 (1995)
Neron, E., Baptiste, P., Gupta, J.N.D.: Solving hybrid flow shop problem using energetic reasoning and global operations. Omega 29(6), 501–511 (2001)
Carlier, J., Neron, E.: An exact method for solving the multi-processor flow-shop. RAIRO-Oper. Res. 34(1), 1–25 (2000)
Ruiz, R., Serifoglu, F.S., Urlings, T.: Modeling realistic hybrid flexible flowshop scheduling problems. Comput. Oper. Res. 35(4), 1151–1175 (2008)
Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11, 91–95 (1983)
Kahraman, C., Engin, O., Kaya, I., Yilmaz, M.K.: An application of effective genetic algorithms for solving hybrid flow shop scheduling problems. Int. J. Comput. Intell. Sys. 1(2), 134–147 (2008)
Engin, O., Doyen, A.: A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener. Comp. Sys. 20, 1083–1095 (2004)
Alaykyran, K., Engin, O., Doyen, A.: Using ant colony optimization to solve hybrid flow shop scheduling problems. Int. J. Adv. Manuf. Tech. 35, 541–550 (2007)
Niu, Q., Zhou, T., Ma, S.: A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion. J. Univers. Comput. Sci. 15, 765–785 (2009)
Liao, C.J., Tjandradjaja, E., Chung, T.P.: An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl. Soft. Comput. 12(6), 1755–1764 (2012)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report, Computer Engineering Department, Engineering Faculty, Erciyes University (2005)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony algorithm. J. Global. Optim. 39(3), 459–471 (2007)
Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft. Comput. 8(1), 687–697 (2008)
Wardono, B., Fathi, Y.: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur. J. Oper. Res. 155, 380–401 (2004)
Oguz, C., Zinder, Y., Do, V.H., Janiak, A., Lichtenstein, M.: Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152, 115–131 (2004)
Oguz, C., Ercan, M.F.: A genetic algorithm for hybrid flow shop scheduling with multiprocessor tasks. J. Scheduling 8, 323–351 (2005)
Goldberg, D.E., Lingle, R.J.: Alleles, loci and the traveling salesman problem. In: 1st International Conference on Genetic Algorithms and their Application, pp. 154–159. Lawrence Erlbaum (1985)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)
Ruiz, R., Stutzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033–2049 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cui, Z., Gu, X. (2013). An Improved Discrete Artificial Bee Colony Algorithm for Hybrid Flow Shop Problems. In: Li, K., Li, S., Li, D., Niu, Q. (eds) Intelligent Computing for Sustainable Energy and Environment. ICSEE 2012. Communications in Computer and Information Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37105-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-37105-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37104-2
Online ISBN: 978-3-642-37105-9
eBook Packages: Computer ScienceComputer Science (R0)