Semi-online Machine Covering on Two Uniform Machines with Known Total Size

ISSN： 0010-485X

Source： Computing, Vol.78, Iss.4, 2006-12, pp. : 369-378

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 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

Semi-Online Algorithms for Parallel Machine Scheduling Problems

By Dósa G. He Y.

Computing, Vol. 72, Iss. 3-4, 2004-06 ,pp. : 355-363

Springer Publishing Company

Access to resources Recommend Favorite

An optimal online algorithm for scheduling two machines with release times

By Noga

Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. : 133-143

Elsevier

Access to resources Recommend Favorite

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”

By Tao Jiping Chao Zhijun Xi Yugeng

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 359-362

Springer Publishing Company

Access to resources Recommend Favorite

Semi-interchangeable machines: implications for workload control

By Henrich P. Land M. J. Gaalman G. J. C.

Production Planning and Control, Vol. 18, Iss. 2, 2007-03 ,pp. : 91-104

Taylor & Francis Ltd

Access to resources Recommend Favorite