703 search results - page 27 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
151
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
141
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
239
click to vote
AUSSOIS
2001
Springer
15 years 8 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
152
click to vote
CCGRID
2006
IEEE
15 years 10 months ago
2006
IEEE
Security-sensitive applications that access and generate large data sets are emerging in various areas such as bioinformatics and high energy physics. Data grids provide data-inte...
174
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...