112 search results - page 8 / 23 » Bi-objective Optimization: An Online Algorithm for Job Assig... |
141
Voted
EOR
2006
15 years 5 months ago
2006
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...
133
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
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...
147
click to vote
COCOON
2009
Springer
16 years 11 days ago
2009
Springer
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...
143
Voted
RANDOM
1999
Springer
15 years 10 months ago
1999
Springer
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...
160
Voted
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
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...