Applying metaheuristic strategies in construction projects management

This work deals with the application of artificial intelligence instruments in a building schedule. In this article there was presented an original optimization scatter search algorithm taking into consideration both technological and organizational restrictions. This algorithm was applied to the real analysis of the industrial building project realization.

[1]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[2]  Edmundas Kazimieras Zavadskas,et al.  Dwelling selection by applying fuzzy game theory , 2011 .

[3]  Rym M'Hallah,et al.  Minimizing the weighted number of tardy jobs on a two-machine flow shop , 2003, Comput. Oper. Res..

[4]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[5]  Raja R. A. Issa,et al.  Construction Project Cash Flow Planning by Pareto Optimality Efficiency Network Model , 2011 .

[6]  Edmundas Kazimieras Zavadskas,et al.  Risk assessment of construction projects , 2010 .

[7]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[8]  Shu-Shun Liu,et al.  Optimizing linear project scheduling with multi-skilled crews , 2012 .

[9]  Gilbert Laporte,et al.  Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave , 1989 .

[10]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[11]  Hui Gao,et al.  Optimal Performance‐Based Building Facility Management , 2010, Comput. Aided Civ. Infrastructure Eng..

[12]  Edward Chlebus,et al.  Methods of risk evaluation in manufacturing systems , 2009 .

[13]  Edmundas Kazimieras Zavadskas,et al.  Selection of construction enterprises management strategy based on the SWOT and multi-criteria analysis , 2011 .

[14]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

[15]  Luh-Maan Chang,et al.  Simulation and analytical techniques for construction resource planning and scheduling , 2012 .

[16]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[17]  Pius J. Egbelu,et al.  Planning and design models for construction industry: A critical survey , 2012 .

[18]  Hojjat Adeli,et al.  Scheduling/Cost Optimization and Neural Dynamics Model for Construction , 1997 .

[19]  Jeffrey E. Schaller,et al.  Note on minimizing total tardiness in a two-machine flowshop , 2005, Comput. Oper. Res..

[20]  Chris N. Potts,et al.  A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop , 1989 .

[21]  T. Nowakowski.  Problems with analyzing operational data uncertainty , 2010 .

[22]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[23]  Khaled A El-Rayes,et al.  Optimizing Resource Utilization for Repetitive Construction Projects , 2001 .

[24]  Alan D. Russell,et al.  New Generation of Planning Structures , 1993 .

[25]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[26]  Photios G. Ioannou,et al.  Scheduling projects with repeating activities , 1998 .

[27]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[28]  Shu-Shun Liu,et al.  Optimizing project selection and scheduling problems with time-dependent resource constraints , 2011 .

[29]  Mieczysław Wodecki.  A block approach to earliness-tardiness scheduling problems , 2009 .

[30]  Alan D. Russell,et al.  Extensions to Linear Scheduling Optimization , 1988 .

[31]  T. Yamada,et al.  Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[32]  Neil N. Eldin,et al.  DYNAMIC PROGRAMMING ApPROACH TO SCHEDULING OF NONSERIAL LINEAR PROJECT , 1996 .

[33]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[34]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[35]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[36]  F. Glover,et al.  Sequential and parallel path-relinking algorithms for the quadratic assignment problem , 2005, IEEE Intelligent Systems.

[37]  Edmundas Kazimieras Zavadskas,et al.  Multiple criteria analysis of foundation instalment alternatives by applying Additive Ratio Assessment (ARAS) method , 2010 .

[38]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..