Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
Identifieur interne : 002F98 ( Main/Exploration ); précédent : 002F97; suivant : 002F99Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
Auteurs : Rema Padman [États-Unis] ; Dwight E. Smith-Daniels [États-Unis]Source :
- European Journal of Operational Research [ 0377-2217 ] ; 1993.
Abstract
In this paper we consider the Resource Constrained Project Scheduling Problem with the objective of maximizing the Net Present Value of project cash flows. We present eight greedy heuristics, embedded in a single-pass, forward algorithm that uses information from a relaxed optimization model to schedule activities. In contrast to our previous research, activities are released for scheduling when they are precedence feasible. The heuristics require the evaluation of the earliness costs and tardiness penalties for each activity that are provided by the relaxed optimization model. We compare the performance of these heuristics to that of heuristics selected from our earlier research that delay the consideration of an activity for scheduling until the activities' target time specified by the optimization model becomes current. The results of a series of experiments across 144 different experimental environments indicate that the early release heuristics provide superior NPV results in many project environments.
Url:
DOI: 10.1016/0377-2217(93)90184-O
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001D21
- to stream Istex, to step Curation: 001C01
- to stream Istex, to step Checkpoint: 002258
- to stream Main, to step Merge: 003169
- to stream Main, to step Curation: 002F98
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach</title><author><name sortKey="Padman, Rema" sort="Padman, Rema" uniqKey="Padman R" first="Rema" last="Padman">Rema Padman</name></author><author><name sortKey="Smith Daniels, Dwight E" sort="Smith Daniels, Dwight E" uniqKey="Smith Daniels D" first="Dwight E." last="Smith-Daniels">Dwight E. Smith-Daniels</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:54745EC3B118D93EFF838E530CB9F4AFBD8CF069</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1016/0377-2217(93)90184-O</idno><idno type="url">https://api.istex.fr/document/54745EC3B118D93EFF838E530CB9F4AFBD8CF069/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001D21</idno><idno type="wicri:Area/Istex/Curation">001C01</idno><idno type="wicri:Area/Istex/Checkpoint">002258</idno><idno type="wicri:doubleKey">0377-2217:1993:Padman R:early:tardy:cost</idno><idno type="wicri:Area/Main/Merge">003169</idno><idno type="wicri:Area/Main/Curation">002F98</idno><idno type="wicri:Area/Main/Exploration">002F98</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach</title><author><name sortKey="Padman, Rema" sort="Padman, Rema" uniqKey="Padman R" first="Rema" last="Padman">Rema Padman</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213</wicri:regionArea><placeName><region type="state">Pennsylvanie</region><settlement type="city">Pittsburgh</settlement></placeName><orgName type="university">Université Carnegie-Mellon</orgName></affiliation></author><author><name sortKey="Smith Daniels, Dwight E" sort="Smith Daniels, Dwight E" uniqKey="Smith Daniels D" first="Dwight E." last="Smith-Daniels">Dwight E. Smith-Daniels</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Decision and Information Systems, College of Business, Arizona State University, Tempe, AZ 85287-4706</wicri:regionArea><placeName><region type="state">Arizona</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">European Journal of Operational Research</title><title level="j" type="abbrev">EOR</title><idno type="ISSN">0377-2217</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1993">1993</date><biblScope unit="volume">64</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="295">295</biblScope><biblScope unit="page" to="311">311</biblScope></imprint><idno type="ISSN">0377-2217</idno></series><idno type="istex">54745EC3B118D93EFF838E530CB9F4AFBD8CF069</idno><idno type="DOI">10.1016/0377-2217(93)90184-O</idno><idno type="PII">0377-2217(93)90184-O</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper we consider the Resource Constrained Project Scheduling Problem with the objective of maximizing the Net Present Value of project cash flows. We present eight greedy heuristics, embedded in a single-pass, forward algorithm that uses information from a relaxed optimization model to schedule activities. In contrast to our previous research, activities are released for scheduling when they are precedence feasible. The heuristics require the evaluation of the earliness costs and tardiness penalties for each activity that are provided by the relaxed optimization model. We compare the performance of these heuristics to that of heuristics selected from our earlier research that delay the consideration of an activity for scheduling until the activities' target time specified by the optimization model becomes current. The results of a series of experiments across 144 different experimental environments indicate that the early release heuristics provide superior NPV results in many project environments.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Arizona</li><li>Pennsylvanie</li></region><settlement><li>Pittsburgh</li></settlement><orgName><li>Université Carnegie-Mellon</li></orgName></list><tree><country name="États-Unis"><region name="Pennsylvanie"><name sortKey="Padman, Rema" sort="Padman, Rema" uniqKey="Padman R" first="Rema" last="Padman">Rema Padman</name></region><name sortKey="Smith Daniels, Dwight E" sort="Smith Daniels, Dwight E" uniqKey="Smith Daniels D" first="Dwight E." last="Smith-Daniels">Dwight E. Smith-Daniels</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002F98 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002F98 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:54745EC3B118D93EFF838E530CB9F4AFBD8CF069
|texte= Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
}}
| This area was generated with Dilib version V0.6.32. |  |