1719 search results - page 115 / 344 » Scheduling with soft constraints |
86
Voted
ISSS
1997
IEEE
15 years 4 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
120
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
AIR
2004
15 years 10 days ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
102
Voted
CATA
2003
15 years 1 months ago
2003
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...
103
Voted
DAC
2003
ACM
16 years 1 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...