Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

Author： Detti Paolo   Agnetis Alessandro   Ciaschetti Gianfranco  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.3, 2005-06, pp. : 255-273

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

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

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

Power series approximations for two-class generalized processor sharing systems

By Walraevens Joris   Leeuwaarden J.   Boxma Onno  

Queueing Systems, Vol. 66, Iss. 2, 2010-10 ,pp. : 107-130

Springer Publishing Company

Access to resources Recommend Favorite

RETRACTED ARTICLE: Two efficient algorithms for a quay crane scheduling and assignment problem

By Tavakkoli-Moghaddam R.   Taheri F.   Bazzazi M.   Salahi S.  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 591-591

Springer Publishing Company

Access to resources Recommend Favorite

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

By Angelelli E.   Nagy Á.B.   Speranza M.G.   Tuza Zs.  

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 421-428

Springer Publishing Company

Access to resources Recommend Favorite