Flexible job shop scheduling problem by chemical-reaction optimization algorithm

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, J., Li, Y., Yang, H., Gao, K., Wang, Y., & Sun, T. (2011). Flexible job shop scheduling problem by chemical-reaction optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 584–591). https://doi.org/10.1007/978-3-642-24728-6_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free