Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Minimizing the Total Flow Time for Lot Streaming Flow Shop Using an Effective Discrete Harmony Search Algorithm
verfasst von : Hong-Yan Han
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
This paper presents a discrete harmony search(DHS) algorithm for solving an n-job,m-machine lot-streaming flowshop scheduling problem(LFSP) with equal-size sublots, the objective is to minimize the total flow time. In the proposed DHS algorithm, The discrete job permutation without any conversion is used in the proposed DHS algorithm. To search for the best sequence,the DHS algorithm uses an effective initialization approach and a novel improvisation strategy. At the same time, an effective local search is embedded .Computational results demonstrate that the proposed DHS algorithm is very effectiveness for the lot-streaming flowshop scheduling problem.