2015
DOI: 10.1016/j.amc.2015.02.092
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(10 citation statements)
references
References 32 publications
0
10
0
Order By: Relevance
“…An adaptive-hybrid genetic algorithm was proposed by Zheng 27 for time–cost–quality trade-off problems. Said and Haouari 28 developed a model wherein the simulation–optimization strategy and the mixed-integer programming formulation were used to solve the DTCTP. Tran, Luong-Duc 29 presented an opposition multiple objective symbiotic organisms search (OMOSOS) model for time, cost, quality, and work continuity trade-off in repetitive projects.…”
Section: Literature Reviewmentioning
confidence: 99%
“…An adaptive-hybrid genetic algorithm was proposed by Zheng 27 for time–cost–quality trade-off problems. Said and Haouari 28 developed a model wherein the simulation–optimization strategy and the mixed-integer programming formulation were used to solve the DTCTP. Tran, Luong-Duc 29 presented an opposition multiple objective symbiotic organisms search (OMOSOS) model for time, cost, quality, and work continuity trade-off in repetitive projects.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Basically, S scenarios of the duration and quality of the different modes of each task should be randomly generated. Similarly to previous works [19]- [21]. We assume that P jm the random variable that measures the duration of each task j in the execution mode m is lognormal distributed and we assume that its mean duration µ jm is equal to its nominal duration and its standard deviation σ jm is equal to 0.25 µ * jm ( P jm Lognormal(µ jm , σ jm )).…”
Section: Monte-carlo Simulationmentioning
confidence: 99%
“…At the same time, CTP can be solved by fast polynomial algorithms (see, e.g., [10,19]), while the discrete version of trade-off problems, with the exception of a few kinds of project networks [5] is an NP-hard problem [6]; therefore, the discrete version of timequality-cost trade-off problems are also NP-hard problems [25]. To solve DTPs, heuristic and metaheuristic algorithms are usually applied [23,26]. The recent multimode resourceconstrained project scheduling problems (MRCPSP) (see an excellent review in Habibi et al [11]), do not assume any trade-off functions between time and resources or between time and cost (see Fig.…”
Section: Introductionmentioning
confidence: 99%