Sciweavers

706 search results - page 12 / 142
» Online Interval Scheduling
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Online scheduling in grids
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...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...
COCOON
2001
Springer
14 years 2 days ago
Competitive Online Scheduling with Level of Service
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...
Ee-Chien Chang, Chee-Keng Yap
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Combining integer programming and the randomization method to schedule employees
: 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...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 11 months ago
Better Bounds for Online Scheduling
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...
Susanne Albers
ORL
2002
81views more  ORL 2002»
13 years 7 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
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...
Leah Epstein, John Noga, Gerhard J. Woeginger