Strategies with memories: local search in an application oriented environment Erwin PeschStefan Voß OriginalPaper Pages: 55 - 66
Local search with memory: benchmarking RTS Roberto BattitiGiampietro Tecchiolli OriginalPaper Pages: 67 - 86
A generalized permutation approach to job shop scheduling with genetic algorithms Christian Bierwirth OriginalPaper Pages: 87 - 92
A local search approach for two-dimensional irregular cutting J. BłażewiczR. Walkowiak OriginalPaper Pages: 93 - 98
Efficient heuristics for robot acquisition planning for a CIM system Jack S. CookBernard T. Han OriginalPaper Pages: 99 - 111
Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements Teodor Gabriel CrainicMichel ToulouseMichel Gendreau OriginalPaper Pages: 113 - 123
Scatter search and star-paths: beyond the genetic metaphor Fred Glover OriginalPaper Pages: 125 - 137
Obtaining minimum-correlation Latin Hypercube Sampling plans using an IP-based heuristic Carl M. HarrisKarla L. HoffmanLeslie -Ann Yarrow OriginalPaper Pages: 139 - 148
Solving the damper placement problem via local search heuristics Rex K. Kincaid OriginalPaper Pages: 149 - 158
A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs E. A. de KockE. H. L. AartsJ. H. M. Korst OriginalPaper Pages: 159 - 172
Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling V. Jorge LeonRamamoorthy Balakrishnan OriginalPaper Pages: 173 - 182
A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility Étienne MayrandPierre LefrançoisMarie -Hélène Jobin OriginalPaper Pages: 183 - 191
Heuristic solution approaches to operational forest planning problems Alan T. MurrayRichard L. Church OriginalPaper Pages: 193 - 203
A modification of threshold accepting and its application to the quadratic assignment problem Volker NissenHenrik Paul OriginalPaper Pages: 205 - 210