Results 1  10
of
142
The power of reordering for online minimum makespan scheduling
 In Proc. 49th FOCS
"... In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, w ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
the jobs with a smaller makespan. This is a natural extension of lookahead. We present an extensive study of the power and limits of online reordering for minimum makespan scheduling. As main result, we give, for m identical machines, tight and, in comparison to the problem without reordering, much
Scheduling parallel jobs to minimize the makespan
, 2006
"... We consider the NPhard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, jobdependent number of machines when being processed. We prove that the makespan of any nonpreemptive list ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We consider the NPhard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, jobdependent number of machines when being processed. We prove that the makespan of any nonpreemptive
Optimal Preemptive SemiOnline Scheduling to Minimize Makespan on Two Related Machines
 Operations Research Letters
, 2002
"... We study a preemptive semionline scheduling problem. Jobs with nonincreasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q 1) between the two machines. We design algorithms of optimal competitive ratio ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We study a preemptive semionline scheduling problem. Jobs with nonincreasing sizes arrive one by one to be scheduled on two uniformly related machines. We analyze the algorithms as a function of the speed ratio (q 1) between the two machines. We design algorithms of optimal competitive ratio
Online scheduling with bounded migration.
 Mathematics of Operations Research,
, 2009
"... Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the constr ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject
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
+ bjsj, where aj is the normal or basic processing time and bj is the deteriorating rate. The objective is to minimize the makespan of the schedule. We first consider simple linear deterioration, i.e., pj = bjsj. It has been shown that on m parallel machines, in the onlinelist model, LS (List Scheduling
OnLine Scheduling on Uniform Multiprocessors
, 2001
"... Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s t) units of execution. The online scheduling of hardrealtime systems, in which all jobs mus ..."
Abstract

Cited by 72 (10 self)
 Add to MetaCart
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s t) units of execution. The online scheduling of hardrealtime systems, in which all jobs
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
 Journal of Algorithms
, 1999
"... We give a new efficient approximation algorithm for scheduling precedence constrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j =s i units of time ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
We give a new efficient approximation algorithm for scheduling precedence constrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j =s i units
Minimizing makespan and preemption costs on a system of uniform machines
 In Proc. 10th European Symp. on Algorithms (ESA), volume 2461 of Lecture Notes in Comput. Sci
, 2002
"... Abstract. It is well known that for preemptive scheduling on uniform machines there exist polynomial time exact algorithms, whereas for nonpreemptive scheduling there are probably no such algorithms. However, it is not clear how many preemptions (in total, or per job) suffice in order to guarantee ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. It is well known that for preemptive scheduling on uniform machines there exist polynomial time exact algorithms, whereas for nonpreemptive scheduling there are probably no such algorithms. However, it is not clear how many preemptions (in total, or per job) suffice in order to guarantee
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
"... We consider the problem of preemptive scheduling on uniformly related machines. We present a semionline algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We consider the problem of preemptive scheduling on uniformly related machines. We present a semionline algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard
A Fluid Heuristic for Minimizing Makespan in JobShops
 Oper. Res
, 2001
"... We describe a simple online heuristic for scheduling jobshops. We assume there is a fixed set of routes for the jobs, and many jobs, say N , on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced by the bottlene ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
We describe a simple online heuristic for scheduling jobshops. We assume there is a fixed set of routes for the jobs, and many jobs, say N , on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced
Results 1  10
of
142