Results 1  10
of
1,946
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 12 (1 self)
 Add to MetaCart
need to find a schedule that satisfies the preemption constraints, such that the maximum job completion time is minimized. In minimum preemptions scheduling (MPS) the only feasible schedules are preemptive schedules with the smallest possible makespan. The goal is to find a feasible schedule
The power of preemption . . .
, 2012
"... Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic problems in the area of machine scheduling. In the first part of the paper, we prove that the power of preemption, i.e., the worstcase ratio between the makespan of an optimal nonpreemptive and that of an ..."
Abstract
 Add to MetaCart
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic problems in the area of machine scheduling. In the first part of the paper, we prove that the power of preemption, i.e., the worstcase ratio between the makespan of an optimal nonpreemptive
Minimizing the Makespan for Unrelated Parallel Machines
, 2003
"... In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NPhard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NPhard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results
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
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES
"... We study the scheduling of jobs in a system of two interconnected service stations, called Q 1 and Q2, on m~m � 2! identical machines available in parallel, so that every machine can process any jobs in Q 1 or Q 2+ Preemption is allowed+ Under certain conditions on the arrival, service, and intercon ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We study the scheduling of jobs in a system of two interconnected service stations, called Q 1 and Q2, on m~m � 2! identical machines available in parallel, so that every machine can process any jobs in Q 1 or Q 2+ Preemption is allowed+ Under certain conditions on the arrival, service
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
by the bottleneck machine. We perform a probabilistic analysis of the heuristic, under some assumptions on the distributions of the processing times. We show that our heuristic produces makespan which exceeds the optimal makespan by no more than c log N with a probability which exceeds 1  1/N for all N # 1
Models of Machines and Modules for Mapping to Minimise Makespan in Multicomputers
"... It is now more than a quarter of a century since researchers started publishing papers on mapping strategies for distributing computation across the computation resource of multiprocessor systems. There exists a large body of literature on the subject, but there is no commonlyaccepted framework ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is now more than a quarter of a century since researchers started publishing papers on mapping strategies for distributing computation across the computation resource of multiprocessor systems. There exists a large body of literature on the subject, but there is no commonlyaccepted framework
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 17 (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
Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors
, 1999
"... Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported ..."
Abstract

Cited by 312 (4 self)
 Add to MetaCart
, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and / or a fee. 2000 ACM 03600300/99/12000406 $5
Results 1  10
of
1,946