Sciweavers

908 search results - page 74 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 4 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
DAM
2006
83views more  DAM 2006»
15 years 3 months ago
Scheduling workover rigs for onshore oil production
Many oil wells in Brazilian onshore fields rely on artificial lift methods. Maintenance services such as cleaning, reinstatement, stimulation and others are essential to these wel...
Dario J. Aloise, Daniel Aloise, Caroline T. M. Roc...
135
Voted
EVOW
2007
Springer
15 years 9 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...
114
Voted
IJCAI
2007
15 years 4 months ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...
150
Voted
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 7 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...