706 search results - page 12 / 142 » Online Interval Scheduling |
134
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
149
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
134
Voted
EOR
2010
15 years 1 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
162
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
137
click to vote
ORL
2002
15 years 3 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...