A multiple-tree search procedure for the resource-constrained project scheduling problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.89, Iss.3, 1996-03, pp. : 525-542

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

The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

By Ahn T. Erenguc S.S.

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 250-259

Elsevier

Access to resources Recommend Favorite

A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

By De Reyck B. Herroelen W.

European Journal of Operational Research, Vol. 111, Iss. 1, 1998-11 ,pp. : 152-174

Elsevier

Access to resources Recommend Favorite

A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

By Heilmann R.

European Journal of Operational Research, Vol. 144, Iss. 2, 2003-01 ,pp. : 348-365

Elsevier

Access to resources Recommend Favorite

A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version

By Bouleimen K. Lecocq H.

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 268-281

Elsevier

Access to resources Recommend Favorite

Tabu search for resource-constrained scheduling

By Verhoeven M.G.A.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 266-276

Elsevier

Access to resources Recommend Favorite