New algorithms for coupled tasks scheduling – a survey

Author： Blazewicz Jacek   Pawlak Grzegorz   Tanas Michal   Wojciechowicz Wojciech  

Publisher： Edp Sciences

E-ISSN： 1290-3868|46|4|335-353

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.46, Iss.4, 2012-12, pp. : 335-353

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

The Orderly Colored Longest Path Problem – a survey of applications and new algorithms

By Szachniuk Marta   Cristina De Cola Maria   Felici Giovanni   Blazewicz Jacek  

RAIRO - Operations Research, Vol. 48, Iss. 1, 2013-12 ,pp. : 25-51

Edp Sciences

Access to resources Recommend Favorite

Multicriteria scheduling problems: a survey

By T'kindt V.   Billaut J.-C.  

RAIRO - Operations Research, Vol. 35, Iss. 2, 2010-03 ,pp. : 143-163

Edp Sciences

Access to resources Recommend Favorite

Scheduling multiprocessor tasks on two parallel processors

By Błażewicz Jacek   Dell'Olmo Paolo   Drozdowski Maciej  

RAIRO - Operations Research, Vol. 36, Iss. 1, 2010-03 ,pp. : 37-51

Edp Sciences

Access to resources Recommend Favorite

Job shop scheduling with unit length tasks

By Akveld Meike   Bernhard Raphael  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 3, 2012-08 ,pp. : 329-342

Edp Sciences

Access to resources Recommend Favorite