An estimation of distribution algorithm for flexible job shop scheduling problem was proposed. The probability model was given using frequency information of pair-wise operations neighboring. Then the structure of optimal individual was marked and the operations of optimal individual were partitioned to some independent sub-blocks. Each sub-block was taken as a whole to be adjusted to avoid repeating search in same area and improve search speed. The experimental results show that the proposed algorithm is efficient for Flexible Job-Shop Problems. © 2011 Springer-Verlag.
CITATION STYLE
He, X., Zeng, J., Xue, S., & Wang, L. (2011). An new estimation of distribution algorithm based edge histogram model for flexible job-shop problem. In Communications in Computer and Information Science (Vol. 158 CCIS, pp. 315–320). https://doi.org/10.1007/978-3-642-22694-6_44
Mendeley helps you to discover research relevant for your work.