Searching for "On-line bin-stretching." – sorted by Relevance.
-
On-line Bin-Stretching
- On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items
- Cited by 10 (1 self) – Add To MetaCart
-
The on-line multiprocessor scheduling problem with known sum of the tasks
- sense similar to the one studied by Azar and Regev (2001) where the authors study an on-line bin-stretching
- Cited by 1 (0 self) – Add To MetaCart
-
Applying extra-resource analysis to load balancing
- ]. Azar and Regev studied the on-line bin-stretching problem [3]. In this problem, the number of bins
- Cited by 11 (0 self) – Add To MetaCart
-
On-Line Extensible Bin Packing With Unequal Bin Sizes
- stretching, was introduced by Azar and Regev [2]. A set of bins of xed sizes is given. Items arrive on-line
- Add To MetaCart
-
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- algorithms are proposed. Recently, Epstein [6] considered a generalization of on-line bin stretching problem
- Cited by 1 (0 self) – Add To MetaCart

