Results 11  20
of
140,841
Nonclairvoyant scheduling for weighted flow time and energy on speed bounded processors
 In Proc. CATS
, 2010
"... Abstract. We consider the online scheduling problem of minimizing total weighted flow time plus energy in the dynamic speed scaling model, where a processor can scale its speed dynamically between 0 and some maximum speed T. In the past few years this problem has been studied extensively under the c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
) flow time plus energy in the infinite speed model (i.e., T = ∞) [11, 12]. This paper makes two contributions to the nonclairvoyant scheduling. First, we resolve the open problem that the unweighted result of LAPS can be extended to the more realistic model with bounded maximum speed. Second, we show
SELFISHMIGRATE: A scalable algorithm for nonclairvoyantly scheduling heterogeneous processors
, 2014
"... ar ..."
SPECIAL ISSUE FOR CATS 2010 Nonclairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors∗
, 2010
"... Abstract: We consider the online scheduling problem of minimizing total weighted flow time plus energy in the dynamic speed scaling model, where a processor can scale its speed dynamically between 0 and some maximum speed T. In the past few years this problem has been studied extensively under the c ..."
Abstract
 Add to MetaCart
) flow time plus energy in the infinite speed model (i.e., T = ∞) [11, 12]. This paper makes two contributions to the nonclairvoyant scheduling. First, we resolve the open problem that the unweighted result of LAPS can be extended to the more realistic model with bounded maximum speed. Second, we show
Online Scheduling with Precedence Constraints
, 2000
"... We consider the online problem of scheduling jobs with precedence constraints on m machines. We concentrate in two models, the model of uniformly related machines and the model of restricted assignment. For the related machines model, we show a lower bound of p m) for the competitive ratio of deter ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider the online problem of scheduling jobs with precedence constraints on m machines. We concentrate in two models, the model of uniformly related machines and the model of restricted assignment. For the related machines model, we show a lower bound of p m) for the competitive ratio
Some efficient solutions to the affine scheduling problem  Part I Onedimensional Time
, 1996
"... Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A s ..."
Abstract

Cited by 266 (22 self)
 Add to MetaCart
Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A
Scheduling to Minimize Average Completion Time: Offline and Online Algorithms
, 1996
"... Timeindexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of singlemachine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good wo ..."
Abstract

Cited by 227 (24 self)
 Add to MetaCart
, we consider the problem of minimizing the total weighted job completion time on a single machine subject to precedence constraints, and give a polynomialtime (4 + ffl)approximation algorithm, for any ffl ? 0; the best previously known guarantee for this problem was superlogarithmic. With somewhat
SCHEDULING WITH AND/OR PRECEDENCE CONSTRAINTS
, 2004
"... In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept h ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept
Stochastic Machine Scheduling with Precedence Constraints
, 2002
"... We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to
Scheduling Jobs with Chain Precedence Constraints
 PARALLEL PROCESSING AND APPLIED MATHEMATICS, PPAM, LNCS 3019
, 2003
"... The problem of scheduling jobs with precedence constraints is studied. A polynomial time approximation scheme is presented for the case when the machines are identical and the precedence graph partitions the jobs into groups of fixed size. As an interesting particular case, this algorithm is a po ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The problem of scheduling jobs with precedence constraints is studied. A polynomial time approximation scheme is presented for the case when the machines are identical and the precedence graph partitions the jobs into groups of fixed size. As an interesting particular case, this algorithm is a
Results 11  20
of
140,841