908 search results - page 70 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
104
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
110
click to vote
ICCAD
2003
IEEE
16 years 8 days ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
128
Voted
IJCAI
1997
15 years 4 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
135
Voted
ESWA
2007
15 years 3 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...