In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we report on an extensive study on the applicability of a metaheuristic approach, called rollout or pilot method. Its basic idea is a look-ahead strategy, guided by one or more subheuristics, called pilot heuristics. Our results indicate that this method is competitive and very promising for solving complex scheduling problems.
|Titolo:||A rollout metaheuristic for job shop scheduling problems|
|Data di pubblicazione:||2004|
|Digital Object Identifier (DOI):||10.1023/B:ANOR.0000039520.24932.4b|
|Appare nelle tipologie:||1.1 Articolo in rivista|