126 search results - page 3 / 26 » A Global Constraint for Total Weighted Completion Time |
EOR
2008
13 years 4 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
AAAI
2008
13 years 7 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper introduces an unsupervised color segmentation
method. The underlying idea is to segment the input
image several times, each time focussing on a different
salient part...