A new formulation for scheduling unrelated processor under precedence constraints

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

Publisher： Edp Sciences

E-ISSN： 1290-3868|33|1|87-92

ISSN： 0399-0559

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

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 Precedence Task Graphs with Disturbances

By Gupta Apurv   Parmentier Gilles   Trystram Denis  

RAIRO - Operations Research, Vol. 37, Iss. 3, 2010-03 ,pp. : 145-156

Edp Sciences

Access to resources Recommend Favorite

Scheduling in the presence of processor networks : complexity and approximation

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

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

Edp Sciences

Access to resources Recommend Favorite

Scheduling an interval ordered precedence graph with communication delays and a limited number of processors

By Kordon Alix Munier   Kacem Fadi   Dupont de Dinechin Benoît   Finta Lucian  

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-03 ,pp. : 73-87

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

Scheduling with periodic availability constraints and irregular cost functions

By Sourd Francis  

RAIRO - Operations Research, Vol. 41, Iss. 2, 2007-06 ,pp. : 141-154

Edp Sciences

Access to resources Recommend Favorite