Abstract
In this paper, an effective estimation of distribution algorithm (EDA) is proposed to solve the flexible job-shop scheduling problem with the criterion to minimize the maximum completion time (makespan). With the framework of the EDA, the probability model is built with the superior population and the new individuals are generated based on probability model. In addition, an updating mechanism of the probability model is proposed and a local search strategy based on critical path is designed to enhance the exploitation ability. Finally, numerical simulation is carried out based on the benchmark instances, and the comparisons with some existing algorithms demonstrate the effectiveness of the proposed algorithm.
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.
References
Dauzere-Peres, S., Paulli, J.: An Integrated Approach for Modeling and Solving the General Multiprocessor Job-shop Scheduling Problem Using Tabu Search. Annals of Operations Research 70(0), 281–306 (1997)
Mastrolilli, M., Gambardella, L.M.: Effective Neighborhood Functions for the Flexible Job Shop Problem. J. of Scheduling 3(1), 3–20 (2000)
Gao, J., Sun, L.Y., Gen, M.: A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems. Computer & Operations Research 35(9), 2892–2907 (2008)
Pezzella, F., Morganti, G., Ciaschetti, G.: A Genetic Algorithm for the Flexible Job-shop Scheduling Problem. Computers & Operations Research 35(10), 3202–3212 (2008)
Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A Knowledge-based Ant Colony Optimization for Flexible Job Shop Scheduling Problems. Applied Soft Computing 10(3), 888–896 (2010)
Li, J.Q., Pan, Q.K., Suganthan, P.N., Chua, T.J.: A Hybrid Tabu Search Algorithm with An Efficient Neighborhood Structure for the Flexible Job Shop Scheduling Problem. International J. of Advanced Manufacturing Technology 52(5-8), 683–697 (2011)
Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Springer, Netherlands (2002)
Zhou, S.D., Sun, Z.Q.: A Survey on Estimation of Distribution Algorithms. Acta Automatica Sinica 33, 113–124 (2007)
Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computers in Simulation 60(3-5), 245–276 (2002)
Brandimarte, P.: Routing and Scheduling in A Flexible Job Shop by Tabu Search. Annals of Operations Research 41(3), 157–183 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, S., Wang, L., Zhou, G., Xu, Y. (2012). An Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-25944-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25943-2
Online ISBN: 978-3-642-25944-9
eBook Packages: Computer ScienceComputer Science (R0)