Exact and heuristic methods for the resource-constrained net present value problem

Gu, H; Schutt, A; Stuckey, PJ; Wallace, MG; Chu, G

Exact and heuristic methods for the resource-constrained net present value problem

Gu, H

Schutt, A Stuckey, PJ Wallace, MG Chu, G

Permalink

Publication Type:: Chapter
Citation:: Handbook on Project Management and Scheduling Vol. 1, 2015, pp. 299 - 318
Issue Date:: 2015-01-01

Closed Access

	Filename	Description	Size
	HanyuChap17.pdf	Published version	157.92 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Gu, H https://orcid.org/0000-0003-2035-2583	en_US
dc.contributor.author	Schutt, A	en_US
dc.contributor.author	Stuckey, PJ	en_US
dc.contributor.author	Wallace, MG	en_US
dc.contributor.author	Chu, G	en_US
dc.date.issued	2015-01-01	en_US
dc.identifier.citation	Handbook on Project Management and Scheduling Vol. 1, 2015, pp. 299 - 318	en_US
dc.identifier.isbn	9783319054421	en_US
dc.identifier.uri	http://hdl.handle.net/10453/123173
dc.description.abstract	© Springer International Publishing Switzerland 2015. An important variant of the resource-constrained project scheduling problem is to maximise the net present value. Significant progress has been made recently on this problem for both exact and inexact methods. The lazy clause generation based constraint programming approach is the state of the art among the exact methods and is briefly discussed. The performance of the Lagrangian relaxation based decomposition method is greatly improved when the forward-backward improvement heuristic is employed. A novel decomposition approach is designed for very large industrial problems which can make full use of the parallel computing capability of modern personal computers. Computational results are also presented to compare different approaches on both difficult benchmark problems and large industrial applications.	en_US
dc.relation.ispartof	Handbook on Project Management and Scheduling Vol. 1	en_US
dc.relation.isbasedon	10.1007/978-3-319-05443-8_14	en_US
dc.title	Exact and heuristic methods for the resource-constrained net present value problem	en_US
dc.type	Chapter
utslib.for	0102 Applied Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© Springer International Publishing Switzerland 2015. An important variant of the resource-constrained project scheduling problem is to maximise the net present value. Significant progress has been made recently on this problem for both exact and inexact methods. The lazy clause generation based constraint programming approach is the state of the art among the exact methods and is briefly discussed. The performance of the Lagrangian relaxation based decomposition method is greatly improved when the forward-backward improvement heuristic is employed. A novel decomposition approach is designed for very large industrial problems which can make full use of the parallel computing capability of modern personal computers. Computational results are also presented to compare different approaches on both difficult benchmark problems and large industrial applications.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/123173