Add to ORKGAbstract. We consider scheduling of unit-length 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 factor of 2 and show that our analysis is tight. Our algorithm runs in time O(n2 logn) and needs only O(n) memory. In fact, the running time is O(ng ∗ logn), where g ∗ is the minimum number of gaps.
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
Recently there has been much progress on the design of approximation algorithms for a variety of sch...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
Abstract We consider scheduling of unit-length jobs with release times and deadlines, where the ob-j...
LNCS v. 9079 entitled: Algorithms and Complexity: 9th International Conference, CIAC 2015 ... Procee...
Abstract. In this paper we investigate a scheduling problem motivated by a variety of practical appl...
AbstractWe consider the scheduling problem in which jobs with release times and delivery times are t...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
The problem of minimizing the maximum delivery times while scheduling tasks on a single processor i...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
We study the problem of scheduling unit execution time (UET) jobs with release dates and precedence ...
International audienceWe consider the problem of minimizing the makespan of a schedule on m parallel...
In this paper we introduce two general techniques for the design and analysis of approximation algor...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
Recently there has been much progress on the design of approximation algorithms for a variety of sch...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
Abstract We consider scheduling of unit-length jobs with release times and deadlines, where the ob-j...
LNCS v. 9079 entitled: Algorithms and Complexity: 9th International Conference, CIAC 2015 ... Procee...
Abstract. In this paper we investigate a scheduling problem motivated by a variety of practical appl...
AbstractWe consider the scheduling problem in which jobs with release times and delivery times are t...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
The problem of minimizing the maximum delivery times while scheduling tasks on a single processor i...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
We study the problem of scheduling unit execution time (UET) jobs with release dates and precedence ...
International audienceWe consider the problem of minimizing the makespan of a schedule on m parallel...
In this paper we introduce two general techniques for the design and analysis of approximation algor...
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
Recently there has been much progress on the design of approximation algorithms for a variety of sch...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...