511 search results - page 55 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
ANOR
2002
15 years 3 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
162
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
161
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
132
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
124
click to vote
EOR
2006
15 years 3 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...