An approximation algorithm for scheduling trees of malleable tasks

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.142, Iss.2, 2002-10, pp. : 242-249

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

An iterative algorithm for scheduling UET tasks with due dates and release times

By Zinder Y.

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 404-416

Elsevier

Access to resources Recommend Favorite

Scheduling multiprocessor tasks - An overview

By Drozdowski M.

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 215-230

Elsevier

Access to resources Recommend Favorite

Scheduling of resource tasks

By Ecker K.H.

European Journal of Operational Research, Vol. 115, Iss. 2, 1999-06 ,pp. : 314-327

Elsevier

Access to resources Recommend Favorite

Scheduling multiprocessor tasks with chain constraints

By Blazewicz J. Zhen L.

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 231-241

Elsevier

Access to resources Recommend Favorite

Scheduling multiprocessor tasks on parallel processors with limited availability

By Blazewicz J. Dell'Olmo P. Drozdowski M. Maczka P.

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 377-389

Elsevier

Access to resources Recommend Favorite