Sciweavers

155 search results - page 25 / 31
» Online Scheduling of Equal-Length Jobs on Parallel Machines
Sort
View
COR
2010
119views more  COR 2010»
13 years 8 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
JSSPP
2004
Springer
14 years 1 months ago
Parallel Computer Workload Modeling with Markov Chains
Abstract. In order to evaluate different scheduling strategies for parallel computers, simulations are often executed. As the scheduling quality highly depends on the workload tha...
Baiyi Song, Carsten Ernemann, Ramin Yahyapour
MFCS
2004
Springer
14 years 1 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
SPAA
2006
ACM
14 years 1 months ago
On the price of heterogeneity in parallel systems
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
Brighten Godfrey, Richard M. Karp
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 8 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley