Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Comparing Schedule Generation Schemes in Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times
verfasst von : Miguel A. González, Camino R. Vela, María Sierra, Inés González, Ramiro Varela
Erschienen in: MICAI 2006: Advances in 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
The Job Shop Scheduling Problem with Sequence Dependent Setup Times (
SDJSS
) is an extension of the Job Shop Scheduling Problem (
JSS
) that has interested to researchers during the last years. In this paper we confront the
SDJSS
problem by means of a memetic algorithm. We study two schedule generation schemas that are extensions of the well known
G
&
T
algorithm for the
JSS
. We report results from an experimental study showing that the proposed approaches produce similar results and that both of them are more efficient than other genetic algorithm proposed in the literature.