MST   2008
Wall of Fame | Most Viewed MST-2008 Paper
157views more  MST 2008»
12 years 11 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source157
2Download preprint from source155
3Download preprint from source150
4Download preprint from source141
5Download preprint from source124
6Download preprint from source121
7Download preprint from source120
8Download preprint from source119
9Download preprint from source118
10Download preprint from source101
11Download preprint from source100
12Download preprint from source94
13Download preprint from source88
14Download preprint from source87
15Download preprint from source86
16Download preprint from source83
17Download preprint from source82
18Download preprint from source82
19Download preprint from source80
20Download preprint from source75
21Download preprint from source74