Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

ISSN： 0178-4617

Source： Algorithmica, Vol.39, Iss.1, 2004-01, pp. : 59-81

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

An asymptotic fully polynomial time approximation scheme for bin covering

By Jansen K. Solis-Oba R.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 543-551

Elsevier

Access to resources Recommend Favorite

Polynomial-time approximation schemes for scheduling problems with time lags

By Zhang Xiandong Velde Steef

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 553-559

Springer Publishing Company

Access to resources Recommend Favorite

On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A. Gasieniec L. Gaur D.R. Krishnamurti R. Rytter W. Zito M.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

By Schuurman P. Woeginger G.J.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 105-122

Elsevier

Access to resources Recommend Favorite

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Błażewicz Jacek Machowiak Maciej Węglarz Jan Kovalyov Mikhail Y. Trystram Denis

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 65-80

Springer Publishing Company

Access to resources Recommend Favorite