On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications

Author： Bampis Evripidis   Giroudeau R.   König J.-C.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|36|1|21-36

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.36, Iss.1, 2010-03, pp. : 21-36

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 UET Trees with Communication Delays on two Processors

By Guinand Frederic   Trystman Denis  

RAIRO - Operations Research, Vol. 34, Iss. 2, 2010-03 ,pp. : 131-144

Edp Sciences

Access to resources Recommend Favorite

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

By Mishra Sounaka   Sikdar Kripasindhu  

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 3, 2010-03 ,pp. : 287-309

Edp Sciences

Access to resources Recommend Favorite

An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗

By He Cheng   Wang Xiumei   Lin Yixun   Mu Yundong  

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-02 ,pp. : 1-8

Edp Sciences

Access to resources Recommend Favorite

An efficient ILP formulation for the single machine scheduling problem

By Briand Cyril   Ourari Samia   Bouzouia Brahim  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 61-71

Edp Sciences

Access to resources Recommend Favorite

Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results

By Damay Jean   Quilliot Alain   Sanlaville Eric  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 325-359

Edp Sciences

Access to resources Recommend Favorite