Sciweavers

112 search results - page 8 / 23
» Bi-objective Optimization: An Online Algorithm for Job Assig...
Sort
View
EOR
2006
103views more  EOR 2006»
13 years 8 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
WAOA
2005
Springer
84views Algorithms» more  WAOA 2005»
14 years 2 months ago
A Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
Tomás Ebenlendr, John Noga, Jiri Sgall, Ger...
COCOON
2009
Springer
14 years 3 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
RANDOM
1999
Springer
14 years 25 days ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
SPAA
2003
ACM
14 years 1 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu