Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.42, Iss.4, 2008-05, pp. : 431-449

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

Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines

By He Yong Jiang Yi Zhou Hao

Acta Mathematica Sinica, Vol. 23, Iss. 1, 2007-01 ,pp. : 165-174

Springer Publishing Company

Access to resources Recommend Favorite

Deterministic and Randomized Algorithms for Distributed On-Line Task Assignment and Load Balancing without Load Status Information

By Li K.

Theory of Computing Systems, Vol. 34, Iss. 5, 2001-10 ,pp. : 453-469

Springer Publishing Company

Access to resources Recommend Favorite

Two Parallel Machines Scheduling

By Lin S-F. Chen J-Y.

Systems Analysis Modelling Simulation, Vol. 42, Iss. 10, 2002-01 ,pp. : 1429-1437

Taylor & Francis Ltd

Access to resources Recommend Favorite

Provably Fast Training Algorithms for Support Vector Machines

By Balcázar José

Theory of Computing Systems, Vol. 42, Iss. 4, 2008-05 ,pp. : 568-595

Springer Publishing Company

Access to resources Recommend Favorite

OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES

The Journal of Symbolic Logic, Vol. 80, Iss. 4, 2015-12 ,pp. : 1116-1130

Cambridge University Press

Access to resources Recommend Favorite