412 search results - page 31 / 83 » Parallel Machine Scheduling Problems with Controllable Proce... |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
IPCCC
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
RTSS
1992
IEEE
14 years 15 days ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
TC
2010
13 years 3 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...