On-line parallel heuristics, processor scheduling and robot searching under the competitive framework

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 527-537

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

By Mokotoff E.

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 133-150

Springer Publishing Company

Access to resources Recommend Favorite

On-line scheduling of parallel jobs with runtime restrictions

By Bischof

Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. : 67-90

Elsevier

Access to resources Recommend Favorite

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

By Musitelli Antoine

Journal of Scheduling, Vol. 14, Iss. 1, 2011-02 ,pp. : 89-101

Springer Publishing Company

Access to resources Recommend Favorite

Competitive analysis of online real-time scheduling algorithms under hard energy constraint

By Devadas Vinay Li Fei Aydin Hakan

Real-Time Systems, Vol. 46, Iss. 1, 2010-09 ,pp. : 88-120

Springer Publishing Company

Access to resources Recommend Favorite

On competitive on-line paging with lookahead

By Breslauer D.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 365-375

Elsevier

Access to resources Recommend Favorite