908 search results - page 8 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
AAAI
1994
13 years 8 months ago
1994
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
EOR
2006
13 years 7 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
Gene libraries have been added to Artificial Immune Systems in analogy to biological immune systems, but to date no careful study of their effect has been made. This work investig...
ICCSA
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
IJCAI
1989
13 years 8 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...