Scheduling in the presence of processor networks : complexity and approximation

Author： Boudet Vincent   Cohen Johanne   Giroudeau Rodolphe   König Jean-Claude  

Publisher： Edp Sciences

E-ISSN： 1290-3868|46|1|1-22

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.46, Iss.1, 2012-05, pp. : 1-22

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

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

By Darties Benoit   Giroudeau Rodolphe   König Jean-Claude   Simonin Gilles  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 781-795

Edp Sciences

Access to resources Recommend Favorite

On the complexity of directed biological networks

By Bonchev D.  

SAR and QSAR in Environmental Research, Vol. 14, Iss. 3, 2003-01 ,pp. : 199-214

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new formulation for scheduling unrelated processor under precedence constraints

By Maculan Nelson   Porto Stella C.S.   Ribeiro Celso C.   Cid Carvalho de Souza Nelson  

RAIRO - Operations Research, Vol. 33, Iss. 1, 2010-03 ,pp. : 87-92

Edp Sciences

Access to resources Recommend Favorite

New complexity results on scheduling problem in a robotic cell

By Chikhi Nacira   Abbas Moncef   Benmansour Rachid   Hanafi Saïd  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-08 ,pp. : 749-762

Edp Sciences

Access to resources Recommend Favorite

Alkane isomers: presence in petroleum ether and complexity

By Lukovits I.   Fodor J.   Gömöry Á.   István K.   Keresztury G.   Kótai L.  

SAR and QSAR in Environmental Research, Vol. 17, Iss. 3, 2006-06 ,pp. : 323-335

Taylor & Francis Ltd

Access to resources Recommend Favorite