A branch and bound algorithm for scheduling projects to maximize net present value: the case of time dependent, contingent cash flows

Author： Shtub A. Etgar R.

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.35, Iss.12, 1997-12, pp. : 3367-3378

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

Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows

By Etgar R. Shtub A.

International Journal of Production Research, Vol. 37, Iss. 2, 1999-01 ,pp. : 329-339

Taylor & Francis Ltd

Access to resources Recommend Favorite

Maximizing the net present value of a project with linear time-dependent cash flows

By Vanhoucke M. Demeulemeester E. Herroelen W.

International Journal of Production Research, Vol. 39, Iss. 14, 2001-09 ,pp. : 3159-3181

Taylor & Francis Ltd

Access to resources Recommend Favorite

A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows

By Vanhoucke Mario

International Journal of Production Research, Vol. 48, Iss. 7, 2010-01 ,pp. : 1983-2001

Taylor & Francis Ltd

Access to resources Recommend Favorite

Considering Risk Within Net Present Value: Calculations for Government Projects

By Gradl Paul

The Engineering Economist, Vol. 54, Iss. 2, 2009-04 ,pp. : 152-174

Taylor & Francis Ltd

Access to resources Recommend Favorite

A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning

By Wang Shijin Liu Ming

International Journal of Production Research, Vol. 51, Iss. 3, 2013-02 ,pp. : 847-868

Taylor & Francis Ltd

Access to resources Recommend Favorite