A GENERAL-FORM FOR THE CAPITAL PROJECTS SEQUENCING PROBLEM

Authors
Citation
Rg. Taylor, A GENERAL-FORM FOR THE CAPITAL PROJECTS SEQUENCING PROBLEM, Computers & industrial engineering, 33(1-2), 1997, pp. 47-50
Citations number
NO
ISSN journal
03608352
Volume
33
Issue
1-2
Year of publication
1997
Pages
47 - 50
Database
ISI
SICI code
0360-8352(1997)33:1-2<47:AGFTCP>2.0.ZU;2-F
Abstract
The capital sequencing problem consists of finding the lowest cost sta rting times for a set of capital projects when such projects: 1) are e xposed to the effects of inflation, 2) cost different amounts, 3) requ ire different lengths of time to complete, and 4) have dissimilar cash outflows per period. The problem is non-trivial when the timing of th e projects is constrained by any one, or any combination of, twelve po ssibilities. The problem is modeled as a straightforward mathematical zero-one programming problem, and is complicated only by the large num ber of constraints which are typically needed for a problem of realist ic size. (C) 1997 Elsevier Science Ltd.