517 search results - page 24 / 104 » Approximation Algorithms for Scheduling with Reservations |
104
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
131
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
121
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
126
Voted
EOR
2006
15 years 3 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
126
click to vote
ECCC
2000
15 years 3 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...