Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
222
Online Scheduling of Jobs with Fixed Start Times on Related Machines
, 2012
"... We consider online preemptive scheduling of jobs with fixed starting times revealed at those times on m uniformly related machines, with the goal of maximizing the total weight of completed jobs. Every job has a size and a weight associated with it. A newly released job must be either assigned to ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We consider online preemptive scheduling of jobs with fixed starting times revealed at those times on m uniformly related machines, with the goal of maximizing the total weight of completed jobs. Every job has a size and a weight associated with it. A newly released job must be either assigned
Online interval scheduling on uniformly related machines
, 2012
"... We consider online preemptive throughput scheduling of jobs with fixed starting times on m uniformly related machines, with the goal of maximizing the profit of the completed jobs. In this problem, jobs are released over time. Every job has a size and a weight associated with it. A newly released jo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We consider online preemptive throughput scheduling of jobs with fixed starting times on m uniformly related machines, with the goal of maximizing the profit of the completed jobs. In this problem, jobs are released over time. Every job has a size and a weight associated with it. A newly released
Faster Approximation Algorithms for Scheduling with Fixed Jobs
"... We study the problem of scheduling jobs on identical parallel machines without preemption. In the considered setting, some of the jobs are already assigned machines and starting times, for example due to external constraints not explicitly modelled. The objective is to assign the rest of the jobs in ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
We study the problem of scheduling jobs on identical parallel machines without preemption. In the considered setting, some of the jobs are already assigned machines and starting times, for example due to external constraints not explicitly modelled. The objective is to assign the rest of the jobs
Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines (Extended Abstract)
, 2012
"... Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management
Online scheduling of equal-length jobs on parallel machines
- Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP
"... Abstract. We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algorithm. Our algorithm ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
algorithm has an additional property called immediate decision: at each time, it is immediately decided for each newly released job if it will be scheduled, and if so, then also the time interval and machine where it is scheduled is fixed and cannot be changed later. We show that for two machines
Online scheduling in grids
- In Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on
, 2008
"... This paper addresses nonclairvoyant and non-preemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processors that are divided into several machines. Jobs are independent, they have a fixed degree of parallelism, and they are su ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
This paper addresses nonclairvoyant and non-preemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processors that are divided into several machines. Jobs are independent, they have a fixed degree of parallelism
Optimal on-Line Algorithms for Single-Machine Scheduling
- In Proceedings of the Fifth Conference On Integer Programming and Combinatorial Optimization
, 1996
"... We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advanc ..."
Abstract
-
Cited by 36 (0 self)
- Add to MetaCart
We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known
SINGLE MACHINE SCHEDULING WITH RELEASE DATES
, 2002
"... We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their ..."
Abstract
-
Cited by 45 (13 self)
- Add to MetaCart
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show
Semi-Online Scheduling with Machine Cost
, 2001
"... Abstract For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently [mreh and Nogaproposed to add the concept of machine cost to scheduling problems and considered the so-called List Model problem. An online algorithm with a co ..."
Abstract
- Add to MetaCart
Abstract For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently [mreh and Nogaproposed to add the concept of machine cost to scheduling problems and considered the so-called List Model problem. An online algorithm with a
Online Weighted Flow Time and Deadline Scheduling
- In RANDOM-APPROX
, 2001
"... In this paper we study some aspects of Weighted Flow Time on parallel machines. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P jr i ; pmtnj P w i F i . We then consider a related Deadline Scheduling Problem that involves minimizing t ..."
Abstract
-
Cited by 51 (21 self)
- Add to MetaCart
In this paper we study some aspects of Weighted Flow Time on parallel machines. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P jr i ; pmtnj P w i F i . We then consider a related Deadline Scheduling Problem that involves minimizing
Results 1 - 10
of
222
