2108 search results - page 21 / 422 » Constrained Heuristic Search |
106
click to vote
HEURISTICS
2006
14 years 11 months ago
2006
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
118
click to vote
AUSAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
127
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
AIPS
2004
15 years 1 months ago
2004
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
125
click to vote
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
14 years 6 months ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...