Indexed by：
Abstract：
Scheduling of tasks is a key issue in the grid system. The solutions space of the sequences of the independent tasks can be efficiently searched using the new backtracking algorithm with the Max-Min pruning measures. Compared to the current algorithms such as Fast-Greedy, Min-Min, Max-Min and Max-Int, the new backtracking algorithm can get the optimal completion time of all tasks.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
Acta Scientiarum Natralium Universitatis Sunyatseni
ISSN： 0529-6579
Year： 2006
Issue： SUPPL.
Volume： 45
Page： 142-144
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
