On a Fix-and-Relax Framework for a Class of Project Scheduling Problems

Laureano Escudero () and Javier Salmeron ()

Annals of Operations Research, 2005, vol. 140, issue 1, 163-188

Abstract: We consider the following problem: Given a set of projects to be executed along a multi-year time horizon, find a sequencing and scheduling feasible solution that optimizes a merit function. A feasible solution should satisfy availability of storable and non-storable resources with budget carrier and non-carrier periods, and precedence, exclusivity and implication relationships among the projects. This is an NP-hard problem. We present several Fix-and-Relax strategies which partition the set of binary variable into clusters in order to selectively explore the branch-and-bound tree. Computational performance is favorably compared with a state-of-the-art optimization engine over a set of real-life cases. Copyright Springer Science + Business Media, Inc. 2005

Keywords: multi-period project management; 0-1 programming; branch-and-bound selective search (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-3970-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:140:y:2005:i:1:p:163-188:10.1007/s10479-005-3970-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-3970-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().