Proceedings of the New Developments in Structural Engineering and Construction 2013
DOI: 10.3850/978-981-07-5354-2_cpm-6-60
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing Schedule Compression Process Using Evolutionary Optimization Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…Furthermore, there have been limited attempts to combine activity crashing algorithms with other compression techniques (i.e. activity overlapping or fast-tracking, and activity substitution) [50][51][52]. Examples of algorithms combining two or three of these techniques include: Liberatore and Pollack-Johnson's [19] In summary, most algorithmic implementations of crashing, whether combined or not with activity overlapping and/or substitution, have been incorporating ill-based models for evaluating sets of activity compressions and costs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Furthermore, there have been limited attempts to combine activity crashing algorithms with other compression techniques (i.e. activity overlapping or fast-tracking, and activity substitution) [50][51][52]. Examples of algorithms combining two or three of these techniques include: Liberatore and Pollack-Johnson's [19] In summary, most algorithmic implementations of crashing, whether combined or not with activity overlapping and/or substitution, have been incorporating ill-based models for evaluating sets of activity compressions and costs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…TCTP and TCQTP). As mentioned before, an activity overlapping (fast-tracking) is combined with activity crashing to reduce the total project duration (Hazini et al , 2013; Gerk and Qassim, 2008). Studies in TCTP are separated into linear programming models (Kelley and Walker, 1959) and non-linear programming models (Fulkerson, 1961).…”
Section: Literature Reviewmentioning
confidence: 99%