703 search results - page 30 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
82
Voted
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...
101
click to vote
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
78
Voted
DAGSTUHL
2008
14 years 11 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
74
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
54
Voted
DATE
1997
IEEE
15 years 1 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...