908 search results - page 72 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
131
click to vote
MP
2006
15 years 3 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
103
Voted
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
104
Voted
IJCAI
1989
15 years 4 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
144
click to vote
ANOR
2010
15 years 25 days ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
114
click to vote
COCOS
2003
Springer
15 years 8 months ago
2003
Springer
In previous work, we have presented a novel global feasibility solver for the large system of quadratic constraints that arise as subproblems in the solving of hard hybrid problems...