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

ISSN： 1439-8516

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

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

Related content

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

By Epstein Leah

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

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

The unsolvability of the uniform halting problem for two state Turing machines

The Journal of Symbolic Logic, Vol. 34, Iss. 2, 1969-07 ,pp. : 161-165

Cambridge University Press

Access to resources Recommend Favorite

MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE

Probability in the Engineering and Informational Sciences, Vol. 31, Iss. 2, 2016-05 ,pp. : 226-238

Cambridge University Press

Access to resources Recommend Favorite

Online Scheduling with Interval Conflicts

By Halldórsson Magnús

Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. : 300-317

Springer Publishing Company

Access to resources Recommend Favorite