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

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

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|4-5|781-795

ISSN： 0399-0559

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

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

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

New algorithms for coupled tasks scheduling – a survey

By Blazewicz Jacek   Pawlak Grzegorz   Tanas Michal   Wojciechowicz Wojciech  

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

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

Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods

By zitouni Rachid   selt Omar  

RAIRO - Operations Research, Vol. 50, Iss. 1, 2015-12 ,pp. : 83-90

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