메뉴 건너뛰기




Volumn 72, Issue , 2014, Pages 161-177

Optimizations in project scheduling: A state-of-art survey

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84896505809     PISSN: 22138986     EISSN: 22138994     Source Type: Book Series    
DOI: 10.1007/978-94-017-8044-5_10     Document Type: Article
Times cited : (15)

References (69)
  • 2
    • 84884502868 scopus 로고    scopus 로고
    • From justification to evaluation: Building information modeling for asset owners
    • (in press)
    • Love PED, Simpson I, Hill A, Standing C (2013) From justification to evaluation: building information modeling for asset owners, Automation in Construction (in press)
    • (2013) Automation in Construction
    • Love, P.E.D.1    Simpson, I.2    Hill, A.3    Standing, C.4
  • 3
    • 84884499483 scopus 로고    scopus 로고
    • Queensland Department of Main Roads, Accessed 28 June 2011
    • Queensland Department of Main Roads (2005) Roads implementation program 2004-2005 to 2008-2009. www.mainroads.qld.gov.au. Accessed 28 June 2011
    • (2005) Roads implementation program 2004-2005 to 2008-2009
  • 5
    • 33645965860 scopus 로고    scopus 로고
    • Causes of delay in large construction projects
    • Assaf S, Al-Hejji S (2006) Causes of delay in large construction projects. Int J Proj Manag 24:349-357
    • (2006) Int J Proj Manag , vol.24 , pp. 349-357
    • Assaf, S.1    Al-Hejji, S.2
  • 6
    • 33745292984 scopus 로고    scopus 로고
    • Survey of the construction industry relative to the use of CPM scheduling for construction projects
    • Galloway PD, Fasce PE (2006) Survey of the construction industry relative to the use of CPM scheduling for construction projects. J Constr Eng Manage 132:697-711
    • (2006) J Constr Eng Manage , vol.132 , pp. 697-711
    • Galloway, P.D.1    Fasce, P.E.2
  • 7
    • 78649792802 scopus 로고    scopus 로고
    • Aboolean satisfiability approach to the resource-constrained project scheduling problem
    • HorbachA(2010)Aboolean satisfiability approach to the resource-constrained project scheduling problem. Ann Oper Res 181:89-107
    • (2010) Ann Oper Res , vol.181 , pp. 89-107
    • Horbach, A.1
  • 8
    • 79957534995 scopus 로고    scopus 로고
    • Metaheuristics for project and construction management-a state-of-the-art review
    • Liao TW, Egbelu PJ, Sarker BR, Leu SS (2011) Metaheuristics for project and construction management-a state-of-the-art review. Autom Constr 20:491-505
    • (2011) Autom Constr , vol.20 , pp. 491-505
    • Liao, T.W.1    Egbelu, P.J.2    Sarker, B.R.3    Leu, S.S.4
  • 9
    • 0000801563 scopus 로고    scopus 로고
    • An integrated survey of deterministic project scheduling
    • Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29:249-272
    • (2001) Omega , vol.29 , pp. 249-272
    • Kolisch, R.1    Padman, R.2
  • 10
    • 77953872383 scopus 로고    scopus 로고
    • A survey of variants and extensions of the resource-constrained project scheduling problem
    • Harmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207:1-14
    • (2010) Eur J Oper Res , vol.207 , pp. 1-14
    • Harmann, S.1    Briskorn, D.2
  • 11
    • 0035612930 scopus 로고    scopus 로고
    • Project scheduling with multiple modes: A genetic algorithm
    • Hartmann S (2001) Project scheduling with multiple modes: a genetic algorithm. Ann Oper Res 102:111-135
    • (2001) Ann Oper Res , vol.102 , pp. 111-135
    • Hartmann, S.1
  • 12
    • 79960557901 scopus 로고    scopus 로고
    • An effective shuffled frog-leaping algorithm for multi-mode resourceconstrained project scheduling problem
    • Wang L, Fang C (2011) An effective shuffled frog-leaping algorithm for multi-mode resourceconstrained project scheduling problem. Inf Sci 181:4804-4822
    • (2011) Inf Sci , vol.181 , pp. 4804-4822
    • Wang, L.1    Fang, C.2
  • 13
    • 84856537184 scopus 로고    scopus 로고
    • An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
    • Bianco L, CaramiaM(2012) An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur J Oper Res 219:73-85
    • (2012) Eur J Oper Res , vol.219 , pp. 73-85
    • Bianco, L.1    Caramia, M.2
  • 14
    • 84876966699 scopus 로고    scopus 로고
    • Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation
    • Jia Q, Seo Y (2013) Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation. Comput Oper Res 40:2037-2050
    • (2013) Comput Oper Res , vol.40 , pp. 2037-2050
    • Jia, Q.1    Seo, Y.2
  • 15
    • 84875485676 scopus 로고    scopus 로고
    • A mixed (continuous + discrete) time-cost trade-off model considering four different relationships with lag time
    • Son J, Hong T, Lee S (2013) A mixed (continuous + discrete) time-cost trade-off model considering four different relationships with lag time. KSCE J Civil Eng 17:281-291
    • (2013) KSCE J Civil Eng , vol.17 , pp. 281-291
    • Son, J.1    Hong, T.2    Lee, S.3
  • 16
    • 70350566565 scopus 로고    scopus 로고
    • Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version
    • HazirO, Haouari M, ErelE(2010) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37:649-655
    • (2010) Comput Oper Res , vol.37 , pp. 649-655
    • Hazir, O.1    Haouari, M.2    Erel, E.3
  • 17
    • 84856998695 scopus 로고    scopus 로고
    • MINLP optimization model for the nonlinear discrete time-cost trade-off problem
    • Klansek U, PsunderM(2012) MINLP optimization model for the nonlinear discrete time-cost trade-off problem. Adv Eng Softw 48:6-16
    • (2012) Adv Eng Softw , vol.48 , pp. 6-16
    • Klansek, U.1    Psunder, M.2
  • 18
    • 84870987193 scopus 로고    scopus 로고
    • Multi-mode resourceconstrained discrete time-cost-resource optimization in project scheduling using nondominated sorting genetic algorithm
    • Ghoddousi P, Eshtehardian E, Jooybanpuur S, Javanmardi A (2013) Multi-mode resourceconstrained discrete time-cost-resource optimization in project scheduling using nondominated sorting genetic algorithm. Autom Constr 30:216-227
    • (2013) Autom Constr , vol.30 , pp. 216-227
    • Ghoddousi, P.1    Eshtehardian, E.2    Jooybanpuur, S.3    Javanmardi, A.4
  • 19
    • 84872259145 scopus 로고    scopus 로고
    • A new tabu search-based hyper-heuristic algorithm for solving construction leveling problmes with limited resource availablitis
    • Koulinas GK, Anagnostopoulos KP (2013) A new tabu search-based hyper-heuristic algorithm for solving construction leveling problmes with limited resource availablitis. Autom Constr 31:169-175
    • (2013) Autom Constr , vol.31 , pp. 169-175
    • Koulinas, G.K.1    Anagnostopoulos, K.P.2
  • 20
    • 84860241716 scopus 로고    scopus 로고
    • Mixed-integer linear programming for resource leveling problem
    • Rieck J, Zimmermann J, Gather T (2012) Mixed-integer linear programming for resource leveling problem. Eur J Oper Res 221:27-37
    • (2012) Eur J Oper Res , vol.221 , pp. 27-37
    • Rieck, J.1    Zimmermann, J.2    Gather, T.3
  • 21
    • 34247345761 scopus 로고    scopus 로고
    • Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm
    • Lin C, GenM(2007) Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm. Appl Math Comput 187:574-583
    • (2007) Appl Math Comput , vol.187 , pp. 574-583
    • Lin, C.1    Gen, M.2
  • 22
    • 84880754760 scopus 로고    scopus 로고
    • An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP)
    • Fan K, You W, Li YY (2013) An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP). Appl Math Comput 221:257-267
    • (2013) Appl Math Comput , vol.221 , pp. 257-267
    • Fan, K.1    You, W.2    Li, Y.Y.3
  • 24
    • 33644584442 scopus 로고    scopus 로고
    • Ant colony optimization for the nonlinear resource allocation problem
    • Yin PY, Wang JY (2006) Ant colony optimization for the nonlinear resource allocation problem. Appl Math Comput 174:1438-1453
    • (2006) Appl Math Comput , vol.174 , pp. 1438-1453
    • Yin, P.Y.1    Wang, J.Y.2
  • 25
    • 34548670503 scopus 로고    scopus 로고
    • A survey on the continuous nonlinear resource allocation problem
    • Patriksson M (2008) A survey on the continuous nonlinear resource allocation problem. Eur J Oper Res 185:1-46
    • (2008) Eur J Oper Res , vol.185 , pp. 1-46
    • Patriksson, M.1
  • 26
    • 67349195453 scopus 로고    scopus 로고
    • Amulti-mode resource constrained discrete time-cost tradeoff problem and its genetic algorithm based solution
    • PengW, WangC(2009)Amulti-mode resource constrained discrete time-cost tradeoff problem and its genetic algorithm based solution. Int J Proj Manage 27:600-609
    • (2009) Int J Proj Manage , vol.27 , pp. 600-609
    • Peng, W.1    Wang, C.2
  • 27
    • 82755177956 scopus 로고    scopus 로고
    • An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem
    • RanjbarM, Khalilzadeh M, Kianfar F, EtminaniK(2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62:264-270
    • (2012) Comput Ind Eng , vol.62 , pp. 264-270
    • Ranjbar, M.1    Khalilzadeh, M.2    Kianfar, F.3    Etminani, K.4
  • 28
    • 84885959065 scopus 로고    scopus 로고
    • Minimizing total weighted late work in the resource-constrained project scheduling problem
    • (in press)
    • Ranjbar M, Hosseinabadi S, Abasian F (2013) Minimizing total weighted late work in the resource-constrained project scheduling problem. Appl Math Model (in press)
    • (2013) Appl Math Model
    • Ranjbar, M.1    Hosseinabadi, S.2    Abasian, F.3
  • 29
    • 84866184881 scopus 로고    scopus 로고
    • An exact method for scheduling of the alternative technologies in R&D projects
    • Ranjbar M, Davari M (2013) An exact method for scheduling of the alternative technologies in R&D projects. Comput Oper Res 40:395-405
    • (2013) Comput Oper Res , vol.40 , pp. 395-405
    • Ranjbar, M.1    Davari, M.2
  • 30
    • 0032709489 scopus 로고    scopus 로고
    • Computign lower bounds by destructive improvement: An application to resource-constrained project scheduling
    • Klein R, Scholl A (1999) Computign lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112:322-346
    • (1999) Eur J Oper Res , vol.112 , pp. 322-346
    • Klein, R.1    Scholl, A.2
  • 31
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • Stinson JP, Davis EW, Khumawala BM(1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 10:23-40
    • (1978) AIIE Trans , vol.10 , pp. 23-40
    • Stinson, J.P.1    Davis, E.W.2    Khumawala, B.M.3
  • 32
    • 79952697948 scopus 로고    scopus 로고
    • Resource leveling in a machine environment
    • Drotos M, Kis T (2011) Resource leveling in a machine environment. Eur J Oper Res 212:12-21
    • (2011) Eur J Oper Res , vol.212 , pp. 12-21
    • Drotos, M.1    Kis, T.2
  • 33
    • 78049437703 scopus 로고    scopus 로고
    • Event-based MILP models for resourceconstrained project scheduling problems
    • Kone O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resourceconstrained project scheduling problems. Comput Oper Res 38:3-13
    • (2011) Comput Oper Res , vol.38 , pp. 3-13
    • Kone, O.1    Artigues, C.2    Lopez, P.3    Mongeau, M.4
  • 34
    • 79954620287 scopus 로고    scopus 로고
    • On the performance of bee algorithms for resourceconstrained project scheduling problem
    • Ziarati K, Akbaria R, Zeighamib V (2011) On the performance of bee algorithms for resourceconstrained project scheduling problem. Appl Soft Comput 11:3720-3733
    • (2011) Appl Soft Comput , vol.11 , pp. 3720-3733
    • Ziarati, K.1    Akbaria, R.2    Zeighamib, V.3
  • 35
    • 0037508562 scopus 로고    scopus 로고
    • Anewefficient simulated annealing algorithm for the resourceconstrained project scheduling problem and its multiple mode version
    • BouleimenK, LecocqH(2003)Anewefficient simulated annealing algorithm for the resourceconstrained project scheduling problem and its multiple mode version. Eur J Oper Res 149:268-281
    • (2003) Eur J Oper Res , vol.149 , pp. 268-281
    • Bouleimen, K.1    Lecocq, H.2
  • 36
    • 12244289668 scopus 로고    scopus 로고
    • Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
    • Mika M, Waligora G, Weglarz J (2005) Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur J Oper Res 164:639-668
    • (2005) Eur J Oper Res , vol.164 , pp. 639-668
    • Mika, M.1    Waligora, G.2    Weglarz, J.3
  • 37
    • 36849084169 scopus 로고    scopus 로고
    • Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
    • Mika M, Waligora G, Weglarz J (2008) Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. Eur J Oper Res 187:1238-1250
    • (2008) Eur J Oper Res , vol.187 , pp. 1238-1250
    • Mika, M.1    Waligora, G.2    Weglarz, J.3
  • 38
    • 84885176419 scopus 로고    scopus 로고
    • Resource constrained project scheduling problem with discounted earliness tardiness penalties: Mathematical modeling and solving procedure
    • (in press)
    • KhoshjahanY, Najafi AA, Nadjafi BA(2013) Resource constrained project scheduling problem with discounted earliness tardiness penalties: mathematical modeling and solving procedure. Comput Ind Eng (in press)
    • (2013) Comput Ind Eng
    • Khoshjahan, Y.1    Najafi, A.A.2    Nadjafi, B.A.3
  • 39
    • 64049109482 scopus 로고    scopus 로고
    • Simulated annealing and tabu search for multi-mode project payment scheduling
    • He Z, Wang N, Jia T, Xu Y (2009) Simulated annealing and tabu search for multi-mode project payment scheduling. Eur J Oper Res 198:688-696
    • (2009) Eur J Oper Res , vol.198 , pp. 688-696
    • He, Z.1    Wang, N.2    Jia, T.3    Xu, Y.4
  • 40
    • 84866366243 scopus 로고    scopus 로고
    • Metaheuristic for multi-mode capital-constrained project payment scheduling
    • He Z, Liu R, Jia T (2012) Metaheuristic for multi-mode capital-constrained project payment scheduling. Eur J Oper Res 223:605-613
    • (2012) Eur J Oper Res , vol.223 , pp. 605-613
    • He, Z.1    Liu, R.2    Jia, T.3
  • 41
    • 77955427801 scopus 로고    scopus 로고
    • Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
    • Anagnostopoulos KP, Kotsikas L (2010) Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem. Appl Math Comput 217:260-270
    • (2010) Appl Math Comput , vol.217 , pp. 260-270
    • Anagnostopoulos, K.P.1    Kotsikas, L.2
  • 43
    • 84876996702 scopus 로고    scopus 로고
    • A competitive magnet-based genetic algorithm for solving the resourceconstrained project scheduling problem
    • Zamani R (2013) A competitive magnet-based genetic algorithm for solving the resourceconstrained project scheduling problem. Eur J Oper Res 229:552-559
    • (2013) Eur J Oper Res , vol.229 , pp. 552-559
    • Zamani, R.1
  • 44
    • 70349276753 scopus 로고    scopus 로고
    • A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
    • Peteghem V, VanhouckeM(2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409-441
    • (2010) Eur J Oper Res , vol.201 , pp. 409-441
    • Peteghem, V.1    Vanhoucke, M.2
  • 45
    • 33749155193 scopus 로고    scopus 로고
    • Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
    • Buddhakulsomsiri J, Kim D (2006) Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. Eur J Oper Res 175:279-295
    • (2006) Eur J Oper Res , vol.175 , pp. 279-295
    • Buddhakulsomsiri, J.1    Kim, D.2
  • 46
    • 63549088269 scopus 로고    scopus 로고
    • A genetic algorithm-based method for scheduling repetitive construction projects
    • Long LD, Ohsato A (2009) A genetic algorithm-based method for scheduling repetitive construction projects. Autom Constr 18:499-511
    • (2009) Autom Constr , vol.18 , pp. 499-511
    • Long, L.D.1    Ohsato, A.2
  • 48
    • 33744511185 scopus 로고    scopus 로고
    • A multi-mode resource-constrained scheduling problem in the context of port operations
    • Lorenzoni LL, Ahonen H, Alvarenga AG (2006) A multi-mode resource-constrained scheduling problem in the context of port operations. Comput Ind Eng 50:55-65
    • (2006) Comput Ind Eng , vol.50 , pp. 55-65
    • Lorenzoni, L.L.1    Ahonen, H.2    Alvarenga, A.G.3
  • 49
    • 60349124753 scopus 로고    scopus 로고
    • Differential evolution for solving multimode resource-constrained project scheduling problems
    • Damaka N, Jarbouia B, Siarryb P, Loukila T (2009) Differential evolution for solving multimode resource-constrained project scheduling problems. Comput Oper Res 36:2653-2659
    • (2009) Comput Oper Res , vol.36 , pp. 2653-2659
    • Damaka, N.1    Jarbouia, B.2    Siarryb, P.3    Loukila, T.4
  • 50
    • 84885185460 scopus 로고    scopus 로고
    • An evolutionary search procedure for optimizing timeCcost performance of projects under multiple renewable resource constraints
    • (in press)
    • Zamani R (2013) An evolutionary search procedure for optimizing timeCcost performance of projects under multiple renewable resource constraints. Comput Ind Eng (in press)
    • (2013) Comput Ind Eng
    • Zamani, R.1
  • 51
    • 79958149341 scopus 로고    scopus 로고
    • An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem
    • Wang L, Fang C (2012) An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Comput Oper Res 39:449-460
    • (2012) Comput Oper Res , vol.39 , pp. 449-460
    • Wang, L.1    Fang, C.2
  • 52
    • 84869497021 scopus 로고    scopus 로고
    • Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems
    • Chen SH, ChenMC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141:24-33
    • (2013) Int J Prod Econ , vol.141 , pp. 24-33
    • Chen, S.H.1    Chen, M.C.2
  • 53
    • 84880216625 scopus 로고    scopus 로고
    • A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem
    • Wang L, Wang S, Liu M (2013) A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem. Int J Prod Res 51:3574-3592
    • (2013) Int J Prod Res , vol.51 , pp. 3574-3592
    • Wang, L.1    Wang, S.2    Liu, M.3
  • 54
    • 59149093294 scopus 로고    scopus 로고
    • Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem
    • Mahdi Mobini MD, Rabban M, Amalnik MS, Razmi J, Rahimi-Vahed AR (2009) Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft Comput 13:597-610
    • (2009) Soft Comput , vol.13 , pp. 597-610
    • Mahdi Mobini, M.D.1    Rabban, M.2    Amalnik, M.S.3    Razmi, J.4    Rahimi-Vahed, A.R.5
  • 55
    • 77951127550 scopus 로고    scopus 로고
    • A scatter search heuristic for maximizing the net present value of a resourceconstrained project with fixed activity cash flows
    • Mario V (2010) A scatter search heuristic for maximizing the net present value of a resourceconstrained project with fixed activity cash flows. Int J Prod Res 48:1983-2001
    • (2010) Int J Prod Res , vol.48 , pp. 1983-2001
    • Mario, V.1
  • 56
    • 0036672003 scopus 로고    scopus 로고
    • Ant colony optimization for resource-constrained project scheduling
    • Merkle D, MiddendorfM, SchmeckH(2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6:333-346
    • (2002) IEEE Trans Evol Comput , vol.6 , pp. 333-346
    • Merkle, D.1    Middendorf, M.2    Schmeck, H.3
  • 57
    • 84884501489 scopus 로고    scopus 로고
    • Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints
    • (online publishing)
    • Li H, Zhang H (2013) Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints. Autom Constr 35:431-438(online publishing)
    • (2013) Autom Constr , vol.35 , pp. 431-438
    • Li, H.1    Zhang, H.2
  • 58
    • 43049173388 scopus 로고    scopus 로고
    • An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)
    • Chaharsooghi SK, Kermani AHM (2008) An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP). Appl Math Comput 200:167-177
    • (2008) Appl Math Comput , vol.200 , pp. 167-177
    • Chaharsooghi, S.K.1    Kermani, A.H.M.2
  • 59
    • 38149009704 scopus 로고    scopus 로고
    • Applying an ant colony optimization algorithm-basedmultiobjective approach for time-cost trade-off
    • Xiong Y, Kuang Y (2008) Applying an ant colony optimization algorithm-basedmultiobjective approach for time-cost trade-off. J Constr Eng Manage 134:153-156
    • (2008) J Constr Eng Manage , vol.134 , pp. 153-156
    • Xiong, Y.1    Kuang, Y.2
  • 60
    • 2342615793 scopus 로고    scopus 로고
    • Applying a genetic algorithm-based multiobjective approach for time-cost optimization
    • Zheng DXM, Ng ST, Kumaraswamy MM (2004) Applying a genetic algorithm-based multiobjective approach for time-cost optimization. J Constr Eng Manage 130:168-176
    • (2004) J Constr Eng Manage , vol.130 , pp. 168-176
    • Zheng, D.X.M.1    Ng, S.T.2    Kumaraswamy, M.M.3
  • 62
    • 70449527542 scopus 로고    scopus 로고
    • Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB
    • Chen RM, Wu CL, Wang CM, Lo ST (2010) Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB. Expert Sys Appl 37:1899-1910
    • (2010) Expert Sys Appl , vol.37 , pp. 1899-1910
    • Chen, R.M.1    Wu, C.L.2    Wang, C.M.3    Lo, S.T.4
  • 63
    • 13444257593 scopus 로고    scopus 로고
    • Justification and RCPSP: A technique that pays
    • Valls V, Ballest F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375-386
    • (2005) Eur J Oper Res , vol.165 , pp. 375-386
    • Valls, V.1    Ballest, F.2    Quintanilla, S.3
  • 64
    • 79951581770 scopus 로고    scopus 로고
    • Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem
    • Chen RM (2011) Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem. Expert Sys Appl 38:7102-7111
    • (2011) Expert Sys Appl , vol.38 , pp. 7102-7111
    • Chen, R.M.1
  • 65
    • 84891488120 scopus 로고    scopus 로고
    • An improved particle swarm optimization for the resource-constrained project scheduling problem
    • Jia Q, Seo Y (2013) An improved particle swarm optimization for the resource-constrained project scheduling problem. Int J Adv Manuf Technol 67:2627-2638
    • (2013) Int J Adv Manuf Technol , vol.67 , pp. 2627-2638
    • Jia, Q.1    Seo, Y.2
  • 66
    • 77950948337 scopus 로고    scopus 로고
    • Multi-objective particle swarm optimization for construction time-cost trade off problems
    • Zhang H, Li H (2010) Multi-objective particle swarm optimization for construction time-cost trade off problems. Constr Manage Econ 28:75-88
    • (2010) Constr Manage Econ , vol.28 , pp. 75-88
    • Zhang, H.1    Li, H.2
  • 67
    • 80052261681 scopus 로고    scopus 로고
    • An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
    • Fang C, Wang L (2012) An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res 39:890-901
    • (2012) Comput Oper Res , vol.39 , pp. 890-901
    • Fang, C.1    Wang, L.2
  • 68
    • 84896510468 scopus 로고    scopus 로고
    • A shuffled frog-leaping model for solving time-cost-resource optimization (TCRO) problems in construction project planning
    • (in press)
    • Ashuri B, Tavakolan M (2013) A shuffled frog-leaping model for solving time-cost-resource optimization (TCRO) problems in construction project planning. J Comput Civil Eng (in press)
    • (2013) J Comput Civil Eng
    • Ashuri, B.1    Tavakolan, M.2
  • 69
    • 79151472736 scopus 로고    scopus 로고
    • A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems
    • Huang YM, Lin JC (2011) A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Expert Sys Appl 38:5438-5447
    • (2011) Expert Sys Appl , vol.38 , pp. 5438-5447
    • Huang, Y.M.1    Lin, J.C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.