2010 | OriginalPaper | Buchkapitel
A Tabu Search Algorithm to Minimize Lateness in Scheduling Problems with Setup Times
verfasst von : Miguel A. González, Camino R. Vela, Ramiro Varela
Erschienen in: Current Topics 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
We face the Job Shop Scheduling Problem with Sequence Dependent Setup Times and maximum lateness minimization as objective function. We propose a disjunctive graph representation for this problem that allows to define the concept of critical path properly. From this representation, we have defined a neighborhood structure suitable to cope with lateness minimization. This neighborhood structure is exploited in combination with a Tabu Search algorithm. We report results from an experimental study across conventional benchmark instances showing that this approach outperforms some of the current state-of-the-art methods.