Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.2, 1996-10, pp. : 242-251

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

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

Nonpreemptive flowshop scheduling with machine dominance

By Cepek O. Okada M. Vlach M.

European Journal of Operational Research, Vol. 139, Iss. 2, 2002-06 ,pp. : 245-261

Elsevier

Access to resources Recommend Favorite

Waiting times of a finite-capacity multi-server model with non-preemptive priorities

By Wagner D.

European Journal of Operational Research, Vol. 102, Iss. 1, 1997-10 ,pp. : 227-241

Elsevier

Access to resources Recommend Favorite

An iterative improvement approach for the nonpreemptive open shop scheduling problem

By Liaw C.-F.

European Journal of Operational Research, Vol. 111, Iss. 3, 1998-12 ,pp. : 509-517

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