Results 1  10
of
73
A Greedy Approximation Algorithm for MinimumGap Scheduling
"... Abstract. We consider scheduling of unitlength jobs with release times and deadlines to minimize the number of gaps in the schedule. The best algorithm for this problem runs in time O(n4) and requires O(n3) memory. We present a simple greedy algorithm that approximates the optimum solution within a ..."
Abstract
 Add to MetaCart
Abstract. We consider scheduling of unitlength jobs with release times and deadlines to minimize the number of gaps in the schedule. The best algorithm for this problem runs in time O(n4) and requires O(n3) memory. We present a simple greedy algorithm that approximates the optimum solution within
Scheduling with Gaps: New Models and Algorithms
"... We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, either in the objective function or as a constraint. Except for a few papers on energy minimization, there is no work in the scheduling literature that ..."
Abstract
 Add to MetaCart
with unit jobs. First we examine scheduling problems with deadlines, where we consider variants of minimumgap scheduling, including maximizing throughput with a budget for gaps or minimizing the number of gaps with a throughput requirement. We then turn to other objective functions. For example, in some
Scheduling with Outliers
"... Abstract. In classical scheduling problems, we are given jobs and machines, and have to schedule all the jobs to minimize some objective function. What if each job has a specified profit, and we are no longer required to process all jobs? Instead, we can schedule any subset of jobs whose total profi ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
profit is at least a (hard) target profit requirement, while still trying to approximately minimize the objective function. We refer to this class of problems as scheduling with outliers. This model was initiated by Charikar and Khuller (SODA ’06) for minimum maxresponse time in broadcast scheduling
Network Resource Scheduling and Management of . . .
, 2007
"... Advance reservation of lightpaths in an optical network has become a popular concept of reserving network resources in support of Grid applications. In this thesis, we have evaluated and compared several algorithms for dynamic scheduling of lightpaths using a flexible advance reservation model. The ..."
Abstract
 Add to MetaCart
usage of the link provides the minimum blocking. Moreover, searching for k alternate paths within the scheduling window significantly improves the performance. For wavelength assignment, we have used a scheme that reduces fragmentation by minimizing unused leading or trailing gaps. We have also analyzed
(Almost) optimal coordination mechanisms for unrelated maching scheduling
 IN 18TH ACMSIAM SYMP. ON DISCRETE ALGORITHMS (SODA
, 2008
"... We investigate the influence of different algorithmic choices on the approximation ratio in selfish scheduling. Our goal is to design local policies that minimize the inefficiency of resulting equilibria. In particular, we design optimal coordination mechanisms for unrelated machine scheduling, and ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
that the approximation ratio of any set of strongly local ordering policies in equilibria is at least Ω(m). In particular, it implies that the approximation ratio of a greedy shortestfirst algorithm for machine scheduling is at least Ω(m). This closes the gap between the known lower and upper bounds for this problem
On the configurationLP for scheduling on unrelated machines
 UNIVERSITÄT BERLIN
, 2010
"... One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NPhard to approximate with a b ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
processing time. He shows that in this setting the configurationLP has an integrality gap of 33/17 ≈ 1.94. Hence, our result imply that the unrelated graph balancing case is significantly more complex than the restricted assignment case. Then we turn to another objective function: maximizing the minimum
New hardness results congestion minimization and machine scheduling
 PROC. 36TH. ANNUAL ACM SYMPOSIUM ON THEORY OF COMPTING
"... We study the approximability of two natural NPhard problems. The first problem is congestion minimization in directed networks. In this problem, we are given a directed graph and a set of sourcesink pairs. The goal is to route all the pairs with minimum congestion on the network edges. The second ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
We study the approximability of two natural NPhard problems. The first problem is congestion minimization in directed networks. In this problem, we are given a directed graph and a set of sourcesink pairs. The goal is to route all the pairs with minimum congestion on the network edges. The second
Approximating Single Machine Scheduling with Scenarios
"... Abstract. In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design algorithms that are applicable in the presence of uncertainty in the definition of the instance. W ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
. We study the single machine scheduling problem with the objective to minimize the weighted sum of completion times. We model uncertainty by replacing the vector of numerical values in the description of the instance by a set of possible vectors, called scenarios. The goal is to find the schedule
Scheduling outtrees of height one in the LogP model
, 1998
"... The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the complexity of scheduling fork graphs in the LogP model. It will be proved that constructing minim ..."
Abstract
 Add to MetaCart
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the complexity of scheduling fork graphs in the LogP model. It will be proved that constructing
Scheduling treestructured programs in the LogP model
, 1997
"... The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimumlength schedules for treestructured programs in the LogP mo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimumlength schedules for treestructured programs in the Log
Results 1  10
of
73