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

Author： Bouleimen K. Lecocq H.

Publisher： Elsevier

ISSN： 0377-2217

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

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 multi-mode resource-constrained project scheduling problem with generalized precedence relations

By De Reyck B. Herroelen W.

European Journal of Operational Research, Vol. 119, Iss. 2, 1999-12 ,pp. : 538-556

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the resource-constrained project scheduling problem

By Brucker P. Knust S. Schoo A. Thiele O.

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

Elsevier

Access to resources Recommend Favorite

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

By Simpson W.P. Patterson J.H.

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

Elsevier

Access to resources Recommend Favorite

A genetic algorithm for multi-mode resource constrained project scheduling problem

By Mori M. Ching C.T.

European Journal of Operational Research, Vol. 100, Iss. 1, 1997-07 ,pp. : 134-141

Elsevier

Access to resources Recommend Favorite

Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm

By Sprecher A. Drexl A.

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

Elsevier

Access to resources Recommend Favorite