517 search results - page 35 / 104 » Approximation Algorithms for Scheduling with Reservations |
134
Voted
DAM
2008
15 years 3 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
120
Voted
AOR
2007
15 years 3 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
140
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
114
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
133
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...