Skip to main content
Top

2014 | OriginalPaper | Chapter

Optimizations in Project Scheduling: A State-of-Art Survey

Authors : Changzhi Wu, Xiangyu Wang, Jiang Lin

Published in: Optimization and Control Methods in Industrial Engineering and Construction

Publisher: Springer Netherlands

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Project scheduling is concerned with an optimal allocation of resources to activities realized over time. To survive in today’s competitive environment, efficient scheduling for project development becomes more and more important. The classical project scheduling is based on the critical path method (CPM) in which resources required are assumed unlimited. This is however impractical. To overcome CPM’s drawback, several techniques and optimizations have been proposed in project scheduling literature. In this chapter, we will present a state-of-art survey on project scheduling from the optimization point of view. In particularly, we will focus on the advancements of optimization formulations and solutions on project scheduling in the recent years.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Egan J (1998) Rethinking construction, the report of the construction task force to the Deputy Prime Minister John Prescott, scope for improving the quality and efficiency of UK construction. HMSO, London Egan J (1998) Rethinking construction, the report of the construction task force to the Deputy Prime Minister John Prescott, scope for improving the quality and efficiency of UK construction. HMSO, London
2.
go back to reference Love PED, Simpson I, Hill A, Standing C (2013) From justification to evaluation: building information modeling for asset owners, Automation in Construction (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)
5.
go back to reference Assaf S, Al-Hejji S (2006) Causes of delay in large construction projects. Int J Proj Manag 24:349–357CrossRef Assaf S, Al-Hejji S (2006) Causes of delay in large construction projects. Int J Proj Manag 24:349–357CrossRef
6.
go back to reference 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–711CrossRef 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–711CrossRef
7.
go back to reference Horbach A (2010) A boolean satisfiability approach to the resource-constrained project scheduling problem. Ann Oper Res 181:89–107CrossRefMATHMathSciNet Horbach A (2010) A boolean satisfiability approach to the resource-constrained project scheduling problem. Ann Oper Res 181:89–107CrossRefMATHMathSciNet
8.
go back to reference 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–505CrossRef 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–505CrossRef
9.
go back to reference Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29:249–272CrossRef Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29:249–272CrossRef
10.
go back to reference Harmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207:1–14CrossRef Harmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207:1–14CrossRef
12.
go back to reference Wang L, Fang C (2011) An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Inf Sci 181:4804–4822CrossRefMATHMathSciNet Wang L, Fang C (2011) An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Inf Sci 181:4804–4822CrossRefMATHMathSciNet
13.
go back to reference Bianco L, Caramia M (2012) An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur J Oper Res 219:73–85CrossRefMATHMathSciNet Bianco L, Caramia M (2012) An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur J Oper Res 219:73–85CrossRefMATHMathSciNet
14.
go back to reference 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–2050CrossRefMathSciNet 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–2050CrossRefMathSciNet
15.
go back to reference 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–291CrossRef 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–291CrossRef
16.
go back to reference Hazir O, Haouari M, Erel E (2010) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37:649–655CrossRefMATH Hazir O, Haouari M, Erel E (2010) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37:649–655CrossRefMATH
17.
go back to reference Klansek U, Psunder M (2012) MINLP optimization model for the nonlinear discrete time-cost trade-off problem. Adv Eng Softw 48:6–16CrossRef Klansek U, Psunder M (2012) MINLP optimization model for the nonlinear discrete time-cost trade-off problem. Adv Eng Softw 48:6–16CrossRef
18.
go back to reference Ghoddousi P, Eshtehardian E, Jooybanpuur S, Javanmardi A (2013) Multi-mode resource-constrained discrete time-cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Autom Constr 30:216–227CrossRef Ghoddousi P, Eshtehardian E, Jooybanpuur S, Javanmardi A (2013) Multi-mode resource-constrained discrete time-cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Autom Constr 30:216–227CrossRef
19.
go back to reference 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–175CrossRef 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–175CrossRef
20.
21.
go back to reference Lin C, Gen M (2007) Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm. Appl Math Comput 187:574–583CrossRefMATHMathSciNet Lin C, Gen M (2007) Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm. Appl Math Comput 187:574–583CrossRefMATHMathSciNet
22.
go back to reference 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–267CrossRefMathSciNet 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–267CrossRefMathSciNet
23.
go back to reference Baradaran S, Ghomi SMTF, Ranjbar M, Hashemin SS (2012) Multi-mode renewable resource-constrained allocation in PERT networks. Appl Soft Comput 12:82–90 Baradaran S, Ghomi SMTF, Ranjbar M, Hashemin SS (2012) Multi-mode renewable resource-constrained allocation in PERT networks. Appl Soft Comput 12:82–90
24.
26.
go back to reference Peng W, Wang C (2009) A multi-mode resource constrained discrete time-cost tradeoff problem and its genetic algorithm based solution. Int J Proj Manage 27:600–609CrossRef Peng W, Wang C (2009) A multi-mode resource constrained discrete time-cost tradeoff problem and its genetic algorithm based solution. Int J Proj Manage 27:600–609CrossRef
27.
go back to reference Ranjbar M, Khalilzadeh M, Kianfar F, Etminani K (2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62:264–270CrossRef Ranjbar M, Khalilzadeh M, Kianfar F, Etminani K (2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62:264–270CrossRef
28.
go back to reference Ranjbar M, Hosseinabadi S, Abasian F (2013) Minimizing total weighted late work in the resource-constrained project scheduling problem. Appl Math Model (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)
29.
go back to reference Ranjbar M, Davari M (2013) An exact method for scheduling of the alternative technologies in R &D projects. Comput Oper Res 40:395–405CrossRefMathSciNet Ranjbar M, Davari M (2013) An exact method for scheduling of the alternative technologies in R &D projects. Comput Oper Res 40:395–405CrossRefMathSciNet
30.
go back to reference Klein R, Scholl A (1999) Computign lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112:322–346CrossRefMATH Klein R, Scholl A (1999) Computign lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112:322–346CrossRefMATH
31.
go back to reference Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 10:23–40CrossRef Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 10:23–40CrossRef
33.
go back to reference Kone O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resource-constrained project scheduling problems. Comput Oper Res 38:3–13CrossRefMATHMathSciNet Kone O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resource-constrained project scheduling problems. Comput Oper Res 38:3–13CrossRefMATHMathSciNet
34.
go back to reference Ziarati K, Akbaria R, Zeighamib V (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput 11:3720–3733CrossRef Ziarati K, Akbaria R, Zeighamib V (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput 11:3720–3733CrossRef
35.
go back to reference Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Oper Res 149:268–281CrossRefMATHMathSciNet Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Oper Res 149:268–281CrossRefMATHMathSciNet
36.
go back to reference 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–668CrossRefMATHMathSciNet 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–668CrossRefMATHMathSciNet
37.
go back to reference 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–1250CrossRefMATH 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–1250CrossRefMATH
38.
go back to reference Khoshjahan Y, 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) Khoshjahan Y, 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)
39.
go back to reference 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–696CrossRefMATH 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–696CrossRefMATH
40.
go back to reference He Z, Liu R, Jia T (2012) Metaheuristic for multi-mode capital-constrained project payment scheduling. Eur J Oper Res 223:605–613CrossRef He Z, Liu R, Jia T (2012) Metaheuristic for multi-mode capital-constrained project payment scheduling. Eur J Oper Res 223:605–613CrossRef
41.
go back to reference Anagnostopoulos KP, Kotsikas L (2010) Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem. Appl Math Comput 217:260–270CrossRefMATHMathSciNet Anagnostopoulos KP, Kotsikas L (2010) Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem. Appl Math Comput 217:260–270CrossRefMATHMathSciNet
42.
go back to reference Montoya-Torres JR, utierrez-Franco E, Pirachican-Mayorga C (2010) Project scheduling with limited resources using a genetic algorithm. Int J Project Manage 28:619–628CrossRef Montoya-Torres JR, utierrez-Franco E, Pirachican-Mayorga C (2010) Project scheduling with limited resources using a genetic algorithm. Int J Project Manage 28:619–628CrossRef
43.
go back to reference Zamani R (2013) A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Eur J Oper Res 229:552–559CrossRefMathSciNet Zamani R (2013) A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Eur J Oper Res 229:552–559CrossRefMathSciNet
44.
go back to reference Peteghem V, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409–441CrossRefMATH Peteghem V, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409–441CrossRefMATH
45.
go back to reference 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–295CrossRefMATH 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–295CrossRefMATH
46.
go back to reference Long LD, Ohsato A (2009) A genetic algorithm-based method for scheduling repetitive construction projects. Autom Constr 18:499–511CrossRef Long LD, Ohsato A (2009) A genetic algorithm-based method for scheduling repetitive construction projects. Autom Constr 18:499–511CrossRef
47.
go back to reference Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRef Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRef
48.
go back to reference 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–65CrossRef 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–65CrossRef
49.
go back to reference Damaka N, Jarbouia B, Siarryb P, Loukila T (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36:2653–2659CrossRefMathSciNet Damaka N, Jarbouia B, Siarryb P, Loukila T (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36:2653–2659CrossRefMathSciNet
50.
go back to reference Zamani R (2013) An evolutionary search procedure for optimizing timeCcost performance of projects under multiple renewable resource constraints. Comput Ind Eng (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)
51.
go back to reference 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 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
52.
go back to reference Chen SH, Chen MC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141:24–33CrossRef Chen SH, Chen MC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141:24–33CrossRef
53.
go back to reference 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–3592CrossRef 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–3592CrossRef
54.
go back to reference 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 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
55.
go back to reference Mario V (2010) A scatter search heuristic for maximizing the net present value of a resource-constrained project with fixed activity cash flows. Int J Prod Res 48:1983–2001CrossRefMATH Mario V (2010) A scatter search heuristic for maximizing the net present value of a resource-constrained project with fixed activity cash flows. Int J Prod Res 48:1983–2001CrossRefMATH
56.
go back to reference Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6:333–346CrossRef Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6:333–346CrossRef
57.
go back to reference 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) 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)
58.
go back to reference Chaharsooghi SK, Kermani AHM (2008) An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP). Appl Math Comput 200:167–177CrossRefMATHMathSciNet Chaharsooghi SK, Kermani AHM (2008) An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP). Appl Math Comput 200:167–177CrossRefMATHMathSciNet
59.
go back to reference Xiong Y, Kuang Y (2008) Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off. J Constr Eng Manage 134:153–156CrossRef Xiong Y, Kuang Y (2008) Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off. J Constr Eng Manage 134:153–156CrossRef
60.
go back to reference Zheng DXM, Ng ST, Kumaraswamy MM (2004) Applying a genetic algorithm-based multiobjective approach for time-cost optimization. J Constr Eng Manage 130:168–176CrossRef Zheng DXM, Ng ST, Kumaraswamy MM (2004) Applying a genetic algorithm-based multiobjective approach for time-cost optimization. J Constr Eng Manage 130:168–176CrossRef
61.
go back to reference Mokhtari H, Baradaran Kazemzadeh R, Salmasnia A (2011) Time-cost tradeoff analysis in project management: an ant system approach. IEEE Trans Eng Manage 58:36–43 Mokhtari H, Baradaran Kazemzadeh R, Salmasnia A (2011) Time-cost tradeoff analysis in project management: an ant system approach. IEEE Trans Eng Manage 58:36–43
62.
go back to reference 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–1910CrossRef 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–1910CrossRef
63.
go back to reference Valls V, Ballest F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375–386CrossRefMATH Valls V, Ballest F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375–386CrossRefMATH
64.
go back to reference Chen RM (2011) Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem. Expert Sys Appl 38:7102–7111 Chen RM (2011) Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem. Expert Sys Appl 38:7102–7111
65.
go back to reference Jia Q, Seo Y (2013) An improved particle swarm optimization for the resource-constrained project scheduling problem. Int J Adv Manuf Technol 67:2627–2638CrossRef Jia Q, Seo Y (2013) An improved particle swarm optimization for the resource-constrained project scheduling problem. Int J Adv Manuf Technol 67:2627–2638CrossRef
66.
go back to reference Zhang H, Li H (2010) Multi-objective particle swarm optimization for construction time-cost trade off problems. Constr Manage Econ 28:75–88CrossRef Zhang H, Li H (2010) Multi-objective particle swarm optimization for construction time-cost trade off problems. Constr Manage Econ 28:75–88CrossRef
67.
go back to reference Fang C, Wang L (2012) An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res 39:890–901CrossRefMATHMathSciNet Fang C, Wang L (2012) An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res 39:890–901CrossRefMATHMathSciNet
68.
go back to reference 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) 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)
69.
go back to reference 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–5447CrossRef 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–5447CrossRef
Metadata
Title
Optimizations in Project Scheduling: A State-of-Art Survey
Authors
Changzhi Wu
Xiangyu Wang
Jiang Lin
Copyright Year
2014
Publisher
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-017-8044-5_10