Competitive ratio of List Scheduling on uniform machines and randomized heuristics

ISSN： 1094-6136

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

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 to schedule uniform parallel batch processing machines with dynamic job arrivals

By Li XiaoLin Chen HuaPing Du Bing Tan Qi

International Journal of Computer Integrated Manufacturing, Vol. 26, Iss. 5, 2013-05 ,pp. : 474-486

Taylor & Francis Ltd

Access to resources Recommend Favorite

A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS

By Macey Benjamin S. Zomaya Albert Y.

Cybernetics and Systems, Vol. 28, Iss. 7, 1997-10 ,pp. : 535-546

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

By He Yong Jiang Yiwei

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 367-383

Springer Publishing Company

Access to resources Recommend Favorite

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

By Lopez-Ortiz A. Schuierer S.

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

Elsevier

Access to resources Recommend Favorite

Scheduling maintenance services to three machines

By Anily S. Glass C.A. Hassin R.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 375-391

Springer Publishing Company

Access to resources Recommend Favorite