143
click to vote
CPAIOR
15 years 9 months ago
2004 Springer 
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
138
click to vote
CPAIOR
15 years 7 months ago
2004 Springer 
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
132
click to vote
CPAIOR
15 years 7 months ago
2004 Springer 
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
115
click to vote
CPAIOR
15 years 9 months ago
2004 Springer 
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
|
Operations Research