Abstract
In this paper, we propose a novel discrete chemical-reaction optimization (DCRO) algorithm for solving the flexible job shop scheduling problem with three objectives. The molecule is used to represent a solution. The four elementary reactions, i.e., the on-wall ineffective collision, the decomposition, the inter-molecular ineffective collision, and the synthesis, are used as the operators for the hybrid algorithm. In the hybrid algorithm, the crossover operator is embedded to learn information among molecules. To increase the ability to escape from the local optima, the buffer is used as the energy center to share kinetic energy among molecules. Experimental results on the well-known benchmarks show the efficiency and 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
Brandimarte, P.: Routing and Scheduling in A Flexible Job Shop by Tabu Search. Annals of Operations Research 41, 157–183 (1993)
Mastrolilli, M., Gambardella, L.M.: Effective Neighborhood Functions for the Flexible Job Shop Problem. Journal of Scheduling 3(1), 3–20 (2000)
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 Journal of Advanced Manufacturing Technology 52(5-8), 683–697 (2011)
Bożejko, W., Uchroński, M., Wodecki, M.: Parallel Hybrid Metaheuristics for the Flexible Job Shop Problem. Computers & Industrial Engineering 59, 323–333 (2010)
Xia, W.J., Wu, Z.M.: An Effective Hybrid Optimization Approach for Multi-objective Flexible Job-shop Scheduling Problems. Computers and Industrial Engineering 48(2), 409–425 (2005)
Gao, J., Sun, L., Gen, M.: A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems. Computers and Operations Research 35(9), 2892–2907 (2008)
Zhang, G.H., Shao, X.Y., Li, P.G., Gao, L.: An Effective Hybrid Particle Swarm Optimization Algorithm for Multi-objective Flexible Job-shop Scheduling Problem. Computers and Industrial Engineering 56(4), 1309–1318 (2009)
Li, J.Q., Pan, Q.K., Liang, Y.C.: An Effective Hybrid Tabu Search Algorithm for Multi-objective Flexible Job Shop Scheduling Problems. Computers & Industrial Engineering 59(4), 647–662 (2010)
Lam, A.Y.S., Li, V.O.K.: Chemical-Reaction-Inspired Metaheuristic for Optimization. IEEE Transactions on Evolutionary Computation 14(3), 381–399 (2010)
Lam, A.Y.S., Xu, J., Li, V.O.K.: Chemical Reaction Optimization for Population Transition in Peer-to-peer Live Streaming. In: Proceeding of the IEEE Congress on Evolutionary Computation (CEC 2010), Spain, pp. 1429–1436 (July 2010)
Xu, J., Lam, A.Y.S., Li, V.O.K.: Chemical Reaction Optimization for the Grid Scheduling Problem. In: Proceeding of the IEEE International Conference on Communications, Hong Kong, China, pp. 1–5 (2010)
Pezzella, F., Morganti, G., Ciaschetti, G.: A Genetic Algorithm for the Flexible Job-shop Scheduling Problem. Computers & Operations Research 35, 3202–3212 (2008)
Li, J.Q., Pan, Q.K., Xie, S.X.: A Hybrid Variable Neighborhood Search Algorithm for Solving Multi-Objective Flexible Job Shop Problems. ComSIS Computer Science and Information Systems 7(4), 907–930 (2010)
Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-shop Scheduling Problems. IEEE Transactions on Systems, Man and Cybernetics, Part C 32(1), 408–419 (2002)
Liouane, N., Saad, I., Hammadi, S., Borne, P.: Ant Systems & Local Search Optimization for Flexible Job-Shop Scheduling Production. International Journal of Computers, Communications & Control 2, 174–184 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Li, Y., Yang, H., Gao, K., Wang, Y., Sun, T. (2011). Flexible Job Shop Scheduling Problem by Chemical-Reaction Optimization Algorithm. 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_79
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_79
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)