Abstract
In this paper, an effective algorithm based on the shuffled frog leaping algorithm (SFLA) is proposed to solve the hybrid flow-shop (HFS) scheduling problem, which is a strong NP-hard combinational problem with very wide engineering background. By using a special encoding scheme and combining SFLA based memetic search and Meta-Lamarckian local search strategy, the exploration and exploitation abilities are enhanced and well balanced for solving the HFS problems. Simulation results based on some typical problems and comparisons with some existing genetic algorithm and differential evolution demonstrate that the proposed algorithm is effective and robust in solving the HFS problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ruiz, R.: The Hybrid Flow Shop Scheduling Problem. European J. of Operational Research 205(1), 1–18 (2010)
Grabowski, J., Pempera, J.: Sequencing of Jobs in Some Production System. European J. of Operational Research 125(3), 535–550 (2000)
Sherali, H.D., Sarin, S.C., Kodialam, M.S.: Models and Algorithms for A Two-stage Production Process. Production Planning and Control 1(1), 27–39 (1990)
Liu, C.Y., Chang, S.C.: Scheduling Flexible Flow Shops with Sequence Dependent Setup Effects. IEEE Transactions on Robotics and Automation 16(4), 408–419 (2000)
Gupta, J.N.D.: Two-stage Hybrid Flow Shop Scheduling Problem. J. of the Operational Research Society 39(4), 35–364 (1988)
Johnson, S.M.: Optimal Two and Three-stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly 1, 61–68 (1954)
Brah, S.A., Hunsucker, J.L.: Branch and bound algorithm for the flow-shop with multiple processors. European J. of Operational Research 51(1), 88–99 (1991)
Kadipasaoglu, S.N., Xiang, W., Khumawala, B.M.: A Comparison of Sequencing Rules in Static and Dynamic Hybrid Flow Systems. Int. J. of Production Research 35(5), 1359–1384 (1997)
Vairaktarakis, G., Elhafsi, M.: The Use of Flowlines to Simplify Routing Complexity in Two-stage Flowshops. IIE Transactions 32(8), 687–699 (2000)
Bertel, S., Billaut, J.C.: A Genetic Algorithm for An Industrial Multiprocessor Flow Shop Scheduling Problem with Recirculation. European J. of Operational Research 159(3), 651–662 (2004)
Tseng, C.T., Liao, C.J.: A Particle Swarm Optimization Algorithm for Hybrid Flowshop Scheduling with Multiprocessor Tasks. Int. J. of Production Research 46(17), 4655–4670 (2008)
Ying, K.C., Lin, S.W.: Multiprocessor Task Scheduling in Multistage Hybrid Flowshops: An Ant Colony System Approach. Int. J. of Production Research 44(16), 3161–3177 (2006)
Logendran, R., deSzoeke, P., Barnard, F.: Sequence-dependent Group Scheduling Problems in Flexible Flow Shops. Int. J. of Production Economics 102(1), 66–86 (2006)
Xu, Y., Wang, L.: Differential Evolution Algorithm for Hybrid Flow-shop Scheduling Problem. Journal of Systems Engineering and Electronics (2011)
Eusuff, M., Lansey, K.: Optimization of Water Distribution Network Design Using The Shuffled Frog Leaping Algorithm. J. of Water Resources Planning and Management 129(3), 210–225 (2003)
Ong, Y.S., Keane, A.J.: Meta-Lamarckian Learning in Memetic Algorithms. IEEE Transactions on Evolutionary Computation 8(2), 99–110 (2004)
Paternina-Arboleda, C.D., Montoya-Torres, J.R., Acero-Dominguez, M.J., Herrera-Hernandez, M.C.: Scheduling Jobs on A k-stage Flexible Flow-shop. Annals of Operations Research 164(1), 29–40 (2008)
Zhou, H.R., Tang, W.S., Wei, Y.H.: Optimize Flexible Flow-shop Scheduling Using Genetic Algorithm. Computer Engineering and Applications 45(30), 224–226 (2009)
Cui, J.S., Li, T.K., Zhang, W.X.: Hybrid Flowshop Scheduling Model and Its Genetic Algorithm. J. of University of Science and Technology Beijing 27(5), 623–626 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Y., Wang, L., Zhou, G., Wang, S. (2011). An Effective Shuffled Frog Leaping Algorithm for Solving Hybrid Flow-Shop Scheduling Problem. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_76
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24727-9
Online ISBN: 978-3-642-24728-6
eBook Packages: Computer ScienceComputer Science (R0)