<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0121-1129</journal-id>
<journal-title><![CDATA[Revista Facultad de Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Fac. ing.]]></abbrev-journal-title>
<issn>0121-1129</issn>
<publisher>
<publisher-name><![CDATA[Universidad Pedagógica y Tecnológica de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-11292019000300077</article-id>
<article-id pub-id-type="doi">10.19053/01211129.v28.n52.2019.9756</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Relative Average Deviation as Measure of Robustness in the Stochastic Project Scheduling Problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Desviación relativa promedio como medida de robustez para el problema de programación de proyectos estocástico]]></article-title>
<article-title xml:lang="pt"><![CDATA[Desvio relativo médio como medida de robustez para o problema de programação de projetos estocástico]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ortiz-Pimiento]]></surname>
<given-names><![CDATA[Néstor Raúl]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Díaz-Serna]]></surname>
<given-names><![CDATA[Francisco Javier]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional de Colombia  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2019</year>
</pub-date>
<volume>28</volume>
<numero>52</numero>
<fpage>77</fpage>
<lpage>97</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-11292019000300077&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-11292019000300077&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-11292019000300077&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  In the Project Scheduling Problem (PSP), the solution robustness can be understood as the capacity that a baseline has to support the disruptions generated by unplanned events (risks). A robust baseline of the project can be obtained from redundancy based methods, which are considered proactive methods to solve the stochastic project scheduling problem. In this research, three redundancy based methods are evaluated and their performance is compared in terms of robustness. These methods add extra time to the original activities duration in order to face the eventualities that may appear during the project execution. In this article a new indicator to analyze the solution robustness to the Project Scheduling Problem with random duration of activities is proposed. This indicator called Relative Average Deviation (RAD) is defined as the margin of deviation of the activities&#8217; start times in relation to their durations. The RAD is based in a traditional concept that seeks to minimize the value of the differences between the planned start times and the real executed start times. The planned start times were obtained from the project baseline generated by each redundancy based method and the real executed start times were obtained from a simulation process based on Monte Carlo technique. The new indicator was used to evaluate the robustness of three baselines generated by different methods but applied to the same case study. Finally, the results suggest that the Relative Average Deviation (RAD) facilitates the interpretation of the robustness concept because it focuses on analyzing the deviation margin associated with an activity.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  En el problema de programación de proyectos, la robustez de una solución puede entenderse como la capacidad que posee una línea-base para soportar las disrupciones generadas por eventos no planeados (riesgos). Una linea-base robusta de un proyecto puede ser obtenida a partir de métodos basados en redundancia, los cuales son considerados métodos proactivos, que permiten resolver el problema de programación estocástica de proyectos. En esta investigación son evaluados tres métodos basados en redundancia y su desempeño es comparado en términos de robustez. Estos métodos adicionan tiempo extra a la duración original de las actividades, con el fin de enfrentar las eventualidades que pueden aparecer durante la ejecución del proyecto. En este artículo se propone un indicador, denominado desviación media relativa (RAD, por su sigla en inglés), el cual permite analizar la robustez de las soluciones obtenidas para el Project Scheduling Problem (PSP), con duración aleatoria de actividades. La desviación media relativa (RAD) se define como el margen de desviación de los tiempos de inicio de las actividades de un proyecto, con relación a sus duraciones. La RAD está basada en el concepto tradicinal que busca minimizar la diferencia entre los tiempos de inicio planeados y los tiempos de inicio realmente ejecutados. Los tiempos de inicio planeados fueron obtenidos a partir de la línea-base generada para el proyecto, y los tiempos de inicio realmente ejecutados fueron obtenidos a partir de un proceso de simulación basado en la técnica de Monte Carlo. El nuevo indicador fue utilizado para evaluar la robustez de tres líneas-base generadas por diferentes métodos, pero aplicados a un mismo caso de estudio. Al final pudo concluirse que la desviación media relativa (RAD) facilita la interpretación del concepto de robustez, debido a que se focaliza en analizar el margen de desviación por actividad en cada línea-base.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo  No problema de programação de projetos, a robustez de uma solução pode entender-se como a capacidade que possui uma linha-base para suportar as perturbações geradas por eventos não planejados (riscos). Uma linha-base robusta de um projeto pode ser obtida a partir de métodos baseados em redundância, os quais são considerados métodos proativos, que permitem resolver o problema de programação estocástica de projetos. Nesta pesquisa são avaliados três métodos baseados em redundância e seu desempenho é comparado em termos de robustez. Estes métodos adicionam tempo extra à duração original das atividades, com o fim de enfrentar as eventualidades que possam aparecer durante a execução do projeto. Neste artigo propõe-se um indicador, denominado desvio médio relativo (RAD, por sua sigla em inglês), o qual permite analisar a robustez das soluções obtidas para o Project Scheduling Problem (PSP), com duração aleatória de atividades. O desvio médio relativo (RAD) define-se como a margem de desvio dos tempos de início das atividades de um projeto, com relação a suas durações. O RAD está baseado no conceito tradicional que busca minimizar a diferença entre os tempos de início planejados e os tempos de início realmente executados. Os tempos de início planejados foram obtidos a partir da linha-base gerada para o projeto, e os tempos de início realmente executados foram obtidos a partir de um processo de simulação baseado na técnica de Monte Carlo. O novo indicador foi utilizado para avaliar a robustez de três linhas-base geradas por diferentes métodos, mas aplicados a um mesmo caso de estudo. Ao final pode-se concluir que o desvio médio relativo (RAD) facilita a interpretação do conceito de robustez, devido a que se focaliza em analisar a margem de desvio por atividade em cada linha-base.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[linear programming]]></kwd>
<kwd lng="en"><![CDATA[project management]]></kwd>
<kwd lng="en"><![CDATA[risk analysis]]></kwd>
<kwd lng="en"><![CDATA[robustness]]></kwd>
<kwd lng="en"><![CDATA[scheduling]]></kwd>
<kwd lng="en"><![CDATA[simulation]]></kwd>
<kwd lng="es"><![CDATA[administración de proyectos]]></kwd>
<kwd lng="es"><![CDATA[análisis de riesgos]]></kwd>
<kwd lng="es"><![CDATA[programación lineal]]></kwd>
<kwd lng="es"><![CDATA[robustez]]></kwd>
<kwd lng="es"><![CDATA[simulación]]></kwd>
<kwd lng="pt"><![CDATA[administração de projetos]]></kwd>
<kwd lng="pt"><![CDATA[análise de riscos]]></kwd>
<kwd lng="pt"><![CDATA[programação lineal]]></kwd>
<kwd lng="pt"><![CDATA[robustez]]></kwd>
<kwd lng="pt"><![CDATA[simulação]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malcolm]]></surname>
<given-names><![CDATA[D. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Roseboom]]></surname>
<given-names><![CDATA[J. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Clark]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Fazar]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Application of a Technique for Research and Development Program Evaluation]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1959</year>
<volume>7</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>646-69</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pontrandolfo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Project Duration in Stochastic Networks by the PERT-Path Technique]]></article-title>
<source><![CDATA[Int. J. Proj. Manag.]]></source>
<year>2000</year>
<volume>18</volume>
<page-range>215-22</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[D.-E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Probability of Project Completion Using Stochastic Project Scheduling Simulation]]></article-title>
<source><![CDATA[J. Constr. Eng. Manag.]]></source>
<year>2005</year>
<volume>131</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>310-8</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldratt]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Critical Chain]]></source>
<year>1997</year>
<publisher-loc><![CDATA[Great Barrington MA ]]></publisher-loc>
<publisher-name><![CDATA[The North River Press Publishing Corporation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Van de Vonder]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Demeulemeester]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Herroelen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Use of Buffers in Project Management: The Trade-off between Stability and Makespan]]></article-title>
<source><![CDATA[Int. J. Prod. Econ.]]></source>
<year>2005</year>
<volume>97</volume>
<page-range>227-40</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rezaie]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Manouchehrabadi]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Shirkouhi]]></surname>
<given-names><![CDATA[S. N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Duration Estimation, a New Approach in Critical Chain Scheduling]]></article-title>
<source><![CDATA[Proceedings-2009 3rd Asia International Conference on Modelling and Simulation]]></source>
<year>2009</year>
<page-range>481-4</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bie]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Cui]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[POMS 22nd Annual Conference]]></source>
<year>2011</year>
<conf-name><![CDATA[ Buffer Sizing Approach with Dependence Assumption between Activities in Critical Chain Scheduling]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Project Scheduling Problem with Stochastic Activity Duration Times]]></article-title>
<source><![CDATA[Appl. Math. Comput.]]></source>
<year>2005</year>
<volume>168</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>342-53</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ke]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modeling Stochastic Project Time-Cost Trade-Offs with Time-Dependent Activity Durations]]></article-title>
<source><![CDATA[Appl. Math. Comput.]]></source>
<year>2012</year>
<volume>218</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>9462-9</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gutjahr]]></surname>
<given-names><![CDATA[W. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Strauss]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wagner]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Stochastic Branch and Bound Approach to Activity Crashing in Project Management]]></article-title>
<source><![CDATA[INFORMS J. Comput.]]></source>
<year>2000</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>125-35</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jaskowski]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Biruk]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Method for Improving Stability of Construction Project Schedules through Buffer Allocation]]></article-title>
<source><![CDATA[Technol. Econ. Dev. Econ.]]></source>
<year>2011</year>
<volume>17</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>429-44</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valadares Tavares]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Antunes Ferreira]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Silva Coelho]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the Optimal Management of Project Risk]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>1998</year>
<volume>107</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>451-69</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mizuyama]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[36th International Conference on Computers and Industrial Engineering, ICC and IE]]></source>
<year>2006</year>
<conf-name><![CDATA[ A Time Quality Tradeoff Problem of a Project with Nonstandardized Activities]]></conf-name>
<conf-loc> </conf-loc>
<page-range>3039-49</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mitchell]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Klastorin]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Effective Methodology for the Stochastic Project Compression Problem]]></article-title>
<source><![CDATA[IIE Trans.]]></source>
<year>2007</year>
<volume>39</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>957-69</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Creemers]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Lambrecht]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling Markovian PERT Networks to Maximize the Net Present Value]]></article-title>
<source><![CDATA[Oper. Res. Lett.]]></source>
<year>2010</year>
<volume>38</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>51-6</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kong]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Miao]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Yin]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Risk Prediction of Project Scheduling Based Cloud Model]]></article-title>
<source><![CDATA[IEEE International Conference on Service Operations and Logistics, and Informatics]]></source>
<year>2008</year>
<page-range>2553-7</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biruk]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Jaskowski]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation Modelling Construction Project with Repetitive Tasks Using Petri Nets Theory]]></article-title>
<source><![CDATA[J. Bus. Econ. Manag.]]></source>
<year>2008</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>219-26</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bendavid]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Golany]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Setting Gates for Activities in the Stochastic Project Scheduling Problem through the Cross Entropy Methodology]]></article-title>
<source><![CDATA[Ann. Oper. Res.]]></source>
<year>2011</year>
<volume>189</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>25-42</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bendavid]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Golany]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Predetermined Intervals for Start Times of Activities in the Stochastic Project Scheduling Problem]]></article-title>
<source><![CDATA[Ann. Oper. Res.]]></source>
<year>2011</year>
<volume>186</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>429-42</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohammadi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sayed]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammad]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling New Product Development Projects Using Simulation-Based Dependency Structure Matrix]]></article-title>
<source><![CDATA[Int. J. logisctics Syst. Manag.]]></source>
<year>2014</year>
<volume>19</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>311-28</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[R. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Determination of Critical Chain Project Buffer Based on Information Flow Interactions]]></article-title>
<source><![CDATA[J. Oper. Res. Soc.]]></source>
<year>2016</year>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gálvez]]></surname>
<given-names><![CDATA[E. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Capuz-Rizo]]></surname>
<given-names><![CDATA[S. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Ordieres]]></surname>
<given-names><![CDATA[J. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Method for Identification of Critical Scheduling Decisions]]></article-title>
<source><![CDATA[J. Mod. Proj. Manag.]]></source>
<year>2017</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>46-61</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Br&#269;i&#263;]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kalpic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Fertalj]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Resource Constrained Project Scheduling under Uncertainty: A Survey]]></article-title>
<source><![CDATA[23rd Central European Conference on Information and Intelligent Systems]]></source>
<year>2012</year>
<page-range>401-9</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rostami]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Creemers]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New Strategies for Stochastic Resource-Constrained Project Scheduling]]></article-title>
<source><![CDATA[J. Sched.]]></source>
<year>2017</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-17</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herroelen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Construction of Stable Project Baseline Schedules]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2004</year>
<volume>156</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>550-65</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leon]]></surname>
<given-names><![CDATA[V. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Storer]]></surname>
<given-names><![CDATA[R. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robustness Measures and Robust Scheduling for Job Shops]]></article-title>
<source><![CDATA[IIE Trans. Institute Ind. Eng.]]></source>
<year>1994</year>
<volume>26</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>32-43</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chtourou]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Haouari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Two-Stage-Priority-Rule-Based Algorithm for Robust Resource-Constrained Project Scheduling]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>2008</year>
<volume>55</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>183-94</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hazir]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Haouari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Erel]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robust Scheduling and Robustness Measures for the Discrete Time/Cost Trade-Off Problem]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2010</year>
<volume>207</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>633-43</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>[29]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Khemakhem]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chtourou]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient Robustness Measures for the Resource-Constrained Project Scheduling Problem]]></article-title>
<source><![CDATA[Int. J. Ind. Syst. Eng.]]></source>
<year>2013</year>
<volume>14</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kolisch]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Sprecher]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[PSPLIB - A Project Scheduling Problem Library]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>1996</year>
<volume>96</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>205-16</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>[31]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xiong]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Abbass]]></surname>
<given-names><![CDATA[H. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Knowledge-Based Evolutionary Multiobjective Approach for Stochastic Extended Resource Investment Project Scheduling Problems]]></article-title>
<source><![CDATA[IEEE Trans. Evol. Comput.]]></source>
<year>2014</year>
<volume>18</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>742-63</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ökmen]]></surname>
<given-names><![CDATA[Ö.]]></given-names>
</name>
<name>
<surname><![CDATA[Özta]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Judgmental Risk Analysis Process Development in Construction Projects]]></article-title>
<source><![CDATA[Building and Environment]]></source>
<year>2005</year>
<volume>40</volume>
<page-range>1244-54</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>[33]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zafra-Cabeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ridao]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Camacho]]></surname>
<given-names><![CDATA[E. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Using a Risk-Based Approach to Project Scheduling: A Case Illustration from Semiconductor Manufacturing]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2008</year>
<page-range>708-23</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>[34]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mansoorzadeh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Yusof]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mansoorzadeh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Zeynal]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Comprehensive and Practical Framework for Reliable Scheduling in Project Management]]></article-title>
<source><![CDATA[Adv. Mater. Res.]]></source>
<year>2014</year>
<volume>903</volume>
<page-range>378-83</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic Monitoring and Control of Software Project Effort Based on an Effort Buffer]]></article-title>
<source><![CDATA[J. Oper. Res. Soc.]]></source>
<year>2015</year>
<volume>66</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1555-65</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>[36]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cervantes]]></surname>
<given-names><![CDATA[M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Barber-Sanchís]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lova-Ruiz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nuevos métodos metaheurísticos para la asignación eficiente, optimizada y robusta de recursos limitados]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Valencia ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Politécnica de Valencia]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
