2002 | OriginalPaper | Buchkapitel
A Grasp for Job Shop Scheduling
verfasst von : S. Binato, W. J. Hery, D. M. Loewenstern, M. G. C. Resende
Erschienen in: Essays and Surveys in Metaheuristics
Verlag: Springer US
Enthalten in: Professional Book Archive
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
In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for the job shop scheduling problem (JSP). We incorporate to the conventional GRASP two new concepts: an intensification strategy and POP (Proximate Optimality Principle) in the construction phase. These two concepts were first proposed by Fleurent and Glover (1999) in the context of the quadratic assignment problem. Computational experience on a large set of standard test problems indicates that GRASP is a competitive algorithm for finding approximate solutions of the job shop scheduling problem.