New complexity results on scheduling problem in a robotic cell

Author： Chikhi Nacira   Abbas Moncef   Benmansour Rachid   Hanafi Saïd  

Publisher： Edp Sciences

E-ISSN： 1290-3868|51|3|749-762

ISSN： 0399-0559

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

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

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

Improving the solution complexity of the scheduling problem with deadlines: A general technique∗

By Elalouf Amir   Levner Eugene  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 681-687

Edp Sciences

Access to resources Recommend Favorite

Throughput optimization for the Robotic Cell Problem with Controllable Processing Times

By Al-Salem Mohammed   Kharbeche Mohamed  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-10 ,pp. : 805-818

Edp Sciences

Access to resources Recommend Favorite

New representation to reduce the search space for the resource-constrained project scheduling problem

By Moumene Khaled   Ferland Jacques A.  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 215-228

Edp Sciences

Access to resources Recommend Favorite