A branch-and-cut algorithm for a resource-constrained scheduling problem

Author： Sirdey Renaud   Kerivin Hervé L. M.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|41|3|235-251

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.3, 2007-08, pp. : 235-251

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

A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem

By Zamani Reza  

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

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

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem∗

By Wuliang Peng   Min Huang   Yongping Hao  

RAIRO - Operations Research, Vol. 48, Iss. 4, 2014-07 ,pp. : 595-614

Edp Sciences

Access to resources Recommend Favorite

A branch-and-price-and-cut algorithm for the pattern minimization problem

By Alves Cláudio   Valério de Carvalho J.M.  

RAIRO - Operations Research, Vol. 42, Iss. 4, 2009-04 ,pp. : 435-453

Edp Sciences

Access to resources Recommend Favorite

A branch-and-cut for the Non-Disjoint m-Ring-Star Problem

By Fouilhoux Pierre   Questel Aurélien  

RAIRO - Operations Research, Vol. 48, Iss. 2, 2014-03 ,pp. : 167-188

Edp Sciences

Access to resources Recommend Favorite