908 search results - page 28 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
120
click to vote
HPCN
1995
Springer
15 years 5 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
108
click to vote
AAAI
2007
15 years 4 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
111
click to vote
AMAI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
119
click to vote
DATE
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...