908 search results - page 48 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
116
click to vote
IV
2009
IEEE
15 years 8 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
144
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
102
click to vote
IEAAIE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
130
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
104
click to vote
COMPSAC
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...