2012 | OriginalPaper | Buchkapitel
An Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem
verfasst von : Shengyao Wang, Ling Wang, Gang Zhou, Ye Xu
Erschienen in: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.