908 search results - page 37 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
107
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
120
click to vote
HEURISTICS
2010
14 years 11 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
112
click to vote
DAC
1996
ACM
15 years 6 months ago
1996
ACM
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
134
click to vote
IJCAI
2001
15 years 3 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
ENDM
2010
15 years 1 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...