39 search results - page 5 / 8 » A new algorithm for online uniform-machine scheduling to min... |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
AAAI
2008
13 years 10 months ago
2008
This paper summarizes recent work reported at ICAPS on applying artificial intelligence techniques to the control of production printing equipment. Like many other real-world appl...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
JCO
2007
13 years 7 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...