Sciweavers

501 search results - page 6 / 101
» Scheduling Abstractions for Local Search
Sort
View
JSW
2006
76views more  JSW 2006»
13 years 7 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
CEC
2005
IEEE
14 years 29 days ago
Dynamic multi-swarm particle swarm optimizer with local search
—In this paper, the performance of dynamic multi-swarm particle swarm optimizer (DMS-PSO) on the set of benchmark functions provided for the CEC2008 Special Session on Large Scal...
Jing J. Liang, Ponnuthurai N. Suganthan
CPAIOR
2005
Springer
14 years 26 days ago
Scheduling Social Golfers Locally
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
Iván Dotú, Pascal Van Hentenryck
ECAI
2004
Springer
14 years 22 days ago
Local Search for Heuristic Guidance in Tree Search
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...
AIR
2004
130views more  AIR 2004»
13 years 7 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...