Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Two Techniques to Improve the NEH Algorithm for Flow-Shop Scheduling Problems
verfasst von : Gengcheng Liu, Shiji Song, Cheng Wu
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
Flow-shop scheduling problem (FSP) has been widely investigated in the area of manufacturing systems. Up to now, the NEH algorithm is the best heuristic approach to solve FSP. However, in large-scale problems, it takes quite long time for the NEH algorithm to find an approximate optimal solution. In this paper, two new techniques are proposed to improve the NEH algorithm. Firstly, to reduce the running time, block properties are developed and introduced to NEH algorithm. Secondly, to obtain solutions with smaller makespan, tie-break rules are applied. Simulation results show that these two techniques perform well in improving the NEH algorithm.