Results 1  10
of
318,626
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
Approximation algorithms for scheduling jobs with chain precedence constraints
 In Proc. of the 5th International Conference on Parallel Processing and Applied Mathematics (PPAM ’03), LNCS 3019
, 2003
"... Abstract. The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constra ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence
Scheduling jobs with varying parallelizability to reduce variance
 In SPAA ’10: 22nd ACM Symposium on Parallelism in Algorithms and Architectures
, 2010
"... We give a (2+ɛ)speed O(1)competitive algorithm for scheduling jobs with arbitrary speedup curves for the ℓ2 norm of flow. We give a similar result for the broadcast setting with varying page sizes. ..."
Abstract

Cited by 12 (10 self)
 Add to MetaCart
We give a (2+ɛ)speed O(1)competitive algorithm for scheduling jobs with arbitrary speedup curves for the ℓ2 norm of flow. We give a similar result for the broadcast setting with varying page sizes.
Scheduling jobs with multiple feasible intervals
 In RTCSA ’03: Proceedings of the 9th IEEE International Conference on Embedded and RealTime Computing Systems and Applications. 53–71
, 2003
"... This paper addresses the problem of scheduling realtime jobs that have multiple feasible intervals. The problem is NPhard. We present an optimal branchandbound algorithm. When there is time to compute the schedule, this algorithm can be used. Otherwise, the simple heuristics presented here can b ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper addresses the problem of scheduling realtime jobs that have multiple feasible intervals. The problem is NPhard. We present an optimal branchandbound algorithm. When there is time to compute the schedule, this algorithm can be used. Otherwise, the simple heuristics presented here can
Scheduling Jobs Before ShutDown
 Nordic J. Cornput
, 2000
"... Distributed systems execute background or alternative jobs while waiting for data or requests to arrive from another processor. In those cases, the following shutdown scheduling problem arises: given a set of jobs of known processing time, schedule them on m machines so as to maximize the total wei ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Distributed systems execute background or alternative jobs while waiting for data or requests to arrive from another processor. In those cases, the following shutdown scheduling problem arises: given a set of jobs of known processing time, schedule them on m machines so as to maximize the total
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 550 (3 self)
 Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
Application of Fuzzy Graphs in Scheduling Jobs
"... Given a graph G = (V; E), a coloring function C assigns an integer value C (i) to each node i ∈ V in such a way that the extremes of any edge {i; j} ∈ E cannot share the same color this concept of crisp gragh is used in fuzzy to minimize the working time of N jobs in a single machine. In this paper ..."
Abstract
 Add to MetaCart
Given a graph G = (V; E), a coloring function C assigns an integer value C (i) to each node i ∈ V in such a way that the extremes of any edge {i; j} ∈ E cannot share the same color this concept of crisp gragh is used in fuzzy to minimize the working time of N jobs in a single machine
Approximation Algorithms for Schedulling Jobs in Machines
, 2003
"... This paper presents the main results of the master dissertation of Eduardo Candido Xavier in the study of approximation algorithms for scheduling problems. The main results we present are approximation algorithms for a classconstrained version of the knapsack problem, that has applications in sche ..."
Abstract
 Add to MetaCart
This paper presents the main results of the master dissertation of Eduardo Candido Xavier in the study of approximation algorithms for scheduling problems. The main results we present are approximation algorithms for a classconstrained version of the knapsack problem, that has applications
BiCriteria Algorithm for Scheduling Jobs on Cluster Platforms
 IN: PROCEEDINGS OF SPAA
, 2004
"... We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria
Results 1  10
of
318,626