2006 | OriginalPaper | Buchkapitel
Job-Shop Scheduling by GA. A New Crossover Operator
verfasst von : Czesław Smutnicki, Adam Tyński
Erschienen in: Operations Research Proceedings 2005
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
The new distance measure between job-shop solutions, based on Euclidean measure, has been proposed. The significant positive correlation of the proposed measure with its suitable version based on the Kendall’s tau measure has been revealed. By applying this measure, a new, easy tunable, crossover quasi-operator for the genetic approach is designed. The genetic algorithm, equipped with the new operator, has been applied to the job-shop scheduling problem with the sum of job completion times criterion. Results provided by the algorithm, compared with the best results known in the literature, confirm superiority of the proposed method.