<?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>0012-7353</journal-id>
<journal-title><![CDATA[DYNA]]></journal-title>
<abbrev-journal-title><![CDATA[Dyna rev.fac.nac.minas]]></abbrev-journal-title>
<issn>0012-7353</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0012-73532020000100179</article-id>
<article-id pub-id-type="doi">10.15446/dyna.v87n212.81269</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An optimization model to solve the resource constrained project scheduling problem RCPSP in new product development projects]]></article-title>
<article-title xml:lang="es"><![CDATA[Un modelo de optimización para resolver el problema de programación de proyectos con recursos restringidos RCPSP en proyectos de desarrollo de nuevos productos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ortiz-Pimiento]]></surname>
<given-names><![CDATA[Nestor Raul]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Diaz-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 Escuela de Estudios Industriales y Empresariales ]]></institution>
<addr-line><![CDATA[Bucaramanga ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional de Colombia Facultad de Minas ]]></institution>
<addr-line><![CDATA[Medellín ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2020</year>
</pub-date>
<volume>87</volume>
<numero>212</numero>
<fpage>179</fpage>
<lpage>188</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0012-73532020000100179&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0012-73532020000100179&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0012-73532020000100179&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract New product development projects (NPDP) face different risks that may affect the scheduling. In this article, the purpose was to develop an optimization model to solve the RCPSP in NPDP and obtain a robust baseline for the project. The proposed model includes three stages: the identification of the project&#8217;s risks, an estimation of activities&#8217; duration, and the resolution of an integer linear program. Two versions of the model were designed and compared in order to select the best one. The first version uses a method to estimate the activities&#8217; duration based on the expected value of the impact of the risks and the second version uses a method based on the judgmental risk analysis process. Finally, the two version of the model were applied to a case study and the best version of the model was identified using a robustness indicator that analyses the start times of the baselines generated.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Los proyectos de desarrollo de nuevos productos (PDNP) enfrentan riesgos que afectan su programación. En este artículo, el propósito fue desarrollar un modelo de optimización para resolver el RCPSP en PDNP y obtener una línea-base robusta para el proyecto. El modelo propuesto incluye tres etapas: identificación de riesgos, estimación de la duración de las actividades y resolución de un programa lineal entero. Dos versiones del modelo fueron creadas con el fin de compararlas y seleccionar la mejor versión. La primera versión utiliza un método para estimar la duración de las actividades basado en el valor esperado del impacto de los riesgos, y la segunda, un método basado en el proceso de análisis de riesgos críticos. Finalmente, las dos versiones del modelo fueron aplicadas a un caso de estudio y la mejor versión fue identificada empleando un indicador de robustez que analiza los tiempos de inicio de las líneas-base generadas.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[project scheduling]]></kwd>
<kwd lng="en"><![CDATA[new product development]]></kwd>
<kwd lng="en"><![CDATA[baseline]]></kwd>
<kwd lng="en"><![CDATA[risks]]></kwd>
<kwd lng="en"><![CDATA[random duration]]></kwd>
<kwd lng="en"><![CDATA[robustness]]></kwd>
<kwd lng="es"><![CDATA[programación de proyectos]]></kwd>
<kwd lng="es"><![CDATA[desarrollo de nuevos productos]]></kwd>
<kwd lng="es"><![CDATA[línea-base]]></kwd>
<kwd lng="es"><![CDATA[riesgos]]></kwd>
<kwd lng="es"><![CDATA[duración aleatoria]]></kwd>
<kwd lng="es"><![CDATA[robustez]]></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[Böttcher]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Drexl]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kolisch]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Salewski]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Project scheduling under partially renewable resource constraints]]></article-title>
<source><![CDATA[Manage Sci]]></source>
<year>2008</year>
<volume>45</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>543-59</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[alpant]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Christian]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Michelon]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search]]></article-title>
<source><![CDATA[Ann Oper Res]]></source>
<year>2004</year>
<volume>131</volume>
<page-range>237-57</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[Ortiz-Pimiento]]></surname>
<given-names><![CDATA[N.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Diaz-Serna]]></surname>
<given-names><![CDATA[F.J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The project scheduling problem with non-deterministic activities duration: a literature review]]></article-title>
<source><![CDATA[J Ind Eng Manag]]></source>
<year>2018</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>116-34</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="confpro">
<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>
<source><![CDATA[Resource constrained project scheduling under uncertainty: a survey]]></source>
<year>2012</year>
<conf-name><![CDATA[ 23rdCentral European Conference on Information and Intelligent Systems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>401-9</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pet-Edwards]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mollaghesemi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[A simulation and genetic algorithm approach to stochastic research unconstrained project scheduling]]></source>
<year>1996</year>
<conf-name><![CDATA[ Southcon/96 Conf Rec]]></conf-name>
<conf-loc> </conf-loc>
<page-range>333-8</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Achieving on-time delivery: a two-stage probabilistic scheduling strategy for software projects]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Q]]></given-names>
</name>
<name>
<surname><![CDATA[Garousi]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Madachy]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Pfahl]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[Trustworthy software development processes. ICSP 2009. Lecture Notes in Computer Science]]></source>
<year>2009</year>
<volume>5543</volume>
<page-range>317-29</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xiong]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Abbass]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[An evolutionary multi-objective scenario-based approach for stochastic resource investment project scheduling]]></source>
<year>2011</year>
<conf-name><![CDATA[ Congress of Evolutionary Computation, CEC 2011]]></conf-name>
<conf-loc> </conf-loc>
<page-range>2767-74</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shou]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robust optimization-based genetic algorithm for project scheduling with stochastic activity durations]]></article-title>
<source><![CDATA[International Information Institute (Tokyo). Information, [online]]]></source>
<year>2012</year>
<volume>15</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>4049-64</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[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]]></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="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wei-xin]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Xian-long]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lei]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-objective optimization model for multi-project scheduling on critical chain]]></article-title>
<source><![CDATA[Adv Eng Softw]]></source>
<year>2014</year>
<volume>68</volume>
<page-range>33-9</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A bi-objective model for robust resource- constrained project scheduling problem with random activity durations]]></source>
<year>2015</year>
<conf-name><![CDATA[ Proceedings of 2015 IEEE 12th International Conference on Networking, Sensing and Control]]></conf-name>
<conf-loc> </conf-loc>
<page-range>28-32</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Capa]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ulusoy]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Proactive project scheduling in a R&amp;D department: a bi objective genetic algorithm]]></source>
<year>2015</year>
<conf-name><![CDATA[ International Conference on Industrial Engineering and Operations Management]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-6</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[Mogaadi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaar]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[Scenario-based evolutionary approach for robust RCPSP]]></source>
<year>2015</year>
<conf-name><![CDATA[ Proceedings of the second international, Afro-European Conference for Industrial Advancement]]></conf-name>
<conf-loc> </conf-loc>
<page-range>45-55</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[Tabrizi]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghaderi]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A robust bi-objective model for concurrent planning of project scheduling and material procurement]]></article-title>
<source><![CDATA[Comput Ind Eng]]></source>
<year>2016</year>
<volume>98</volume>
<page-range>11-29</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[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Xiong]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Resilence analysis for projects scheduling with renewable resource constraint and uncertain activity durations]]></article-title>
<source><![CDATA[J Ind Manag Optim]]></source>
<year>2016</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>719-37</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ghoddousi]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Ansari]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Makui]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved robust buffer allocation method for the project scheduling problem]]></article-title>
<source><![CDATA[Eng Optim]]></source>
<year>2017</year>
<volume>49</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>718-31</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[Tukel]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Rom]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Eksioglu]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An investigation of buffer sizing techniques in critical chain scheduling]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2006</year>
<volume>172</volume>
<page-range>401-16</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ashtiani]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Jalali]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Aryanezhad]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Makui]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[A new approach for buffer sizing in critical chain scheduling]]></source>
<year>2007</year>
<conf-name><![CDATA[ International Conference on Industrial Engineering and Engineering Management]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1037-41</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[Ash]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pittman]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Towards holistic project scheduling using critical chain methodology enhanced with PERT buffering chain methodology enhanced with PERT buffering]]></article-title>
<source><![CDATA[Int J Organ Manag]]></source>
<year>2008</year>
<volume>1</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>185-203</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[Fallah]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ashtiani]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Critical chain project scheduling: utilizing uncertainty for buffer sizing]]></article-title>
<source><![CDATA[Int J Res Rev Appl Sci [Online]]]></source>
<year>2010</year>
<volume>3</volume>
<numero>June</numero>
<issue>June</issue>
<page-range>280-9</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Cui]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Bie]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Chai]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Timely project completion probability and stability cost on the interaction among uncertainty of random duration, service level and feeding buffer in a RCPSP environment]]></source>
<year>2011</year>
<conf-name><![CDATA[ International Conference on Management and Service Science]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-4</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[Liu]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Peng]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new buffer setting method based on activity attributes in construction engineering]]></article-title>
<source><![CDATA[Appl Mech Mater]]></source>
<year>2012</year>
<volume>177</volume>
<page-range>3274-81</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Buffer sizing approach in critical chain project management under multiresource constraints]]></source>
<year>2013</year>
<conf-name><![CDATA[ 6thInternational Conference on Information Management, Innovation Management and Industrial Engineering]]></conf-name>
<conf-loc> </conf-loc>
<page-range>71-5</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[Mansoorzadeh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Yusof]]></surname>
<given-names><![CDATA[S.]]></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="B25">
<label>[25]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saihjpal]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[New placement strategy for buffers in critical chain]]></source>
<year>2014</year>
<conf-name><![CDATA[ Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>429-36</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[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Project buffer sizing of a critical chain based on comprehensive resource tightness]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2016</year>
<volume>248</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>174-82</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[Iranmanesh]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mansourian]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kouchaki]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Critical chain scheduling: a new approach for feeding buffer sizing]]></article-title>
<source><![CDATA[Int J Oper Res]]></source>
<year>2016</year>
<volume>25</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>114-30</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tysiak]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Monte Carlo simulation and critical chains]]></source>
<year>2017</year>
<conf-name><![CDATA[ 9thInternational Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications]]></conf-name>
<conf-date>2017</conf-date>
<conf-loc> </conf-loc>
<page-range>471-4</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[Archer]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Armacost]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pet-armacost]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Effectiveness of resource buffers for the stochastic task insertion problem]]></article-title>
<source><![CDATA[J Manag Eng Integr, [online]]]></source>
<year>2009</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>14-21</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schmidt]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Grossmann]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A mixed integer programming model for stochastic scheduling in new product development]]></article-title>
<source><![CDATA[Comput Chem Eng]]></source>
<year>1996</year>
<volume>20</volume>
<numero>96</numero>
<issue>96</issue>
<page-range>S1239-44</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[Subramanian]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Pekny]]></surname>
<given-names><![CDATA[JF]]></given-names>
</name>
<name>
<surname><![CDATA[Reklaitis]]></surname>
<given-names><![CDATA[G.V]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simulation-optimization framework for research and development pipeline management]]></article-title>
<source><![CDATA[AIChE J]]></source>
<year>2001</year>
<volume>47</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2226-42</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[Choi]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Realff]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application]]></article-title>
<source><![CDATA[Comput Chem Eng]]></source>
<year>2004</year>
<volume>28</volume>
<numero>6-7</numero>
<issue>6-7</issue>
<page-range>1039-58</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>[33]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Model and heuristic algorithm of R&amp;D project scheduling problem with stochastic number of activity iterations]]></source>
<year>2005</year>
<conf-name><![CDATA[ IEEE International Conference on Information Reuse and Integration]]></conf-name>
<conf-loc> </conf-loc>
<page-range>276-81</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>[34]</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[A time quality tradeoff problem of a project with nonstandardized activities]]></source>
<year>2006</year>
<conf-name><![CDATA[ 36thInternational Conference on Computers and Industrial Engineering, ICC and IE]]></conf-name>
<conf-loc> </conf-loc>
<page-range>3039-49</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="confpro">
<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.]]></given-names>
</name>
<name>
<surname><![CDATA[Camacho]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[A model predictive control approach for project risk management]]></source>
<year>2007</year>
<conf-name><![CDATA[ Proceedings of the European Control Conference]]></conf-name>
<conf-date>2007</conf-date>
<conf-loc> </conf-loc>
<page-range>3337-43</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>[36]</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.]]></given-names>
</name>
<name>
<surname><![CDATA[Camacho]]></surname>
<given-names><![CDATA[E]]></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>
<volume>190</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>708-23</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>[37]</label><nlm-citation citation-type="confpro">
<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[De Reyck]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[Project scheduling with alternative technologies: incorporating varying activity duration variability]]></source>
<year>2010</year>
<conf-name><![CDATA[ IEEE International Conference on Industrial Engineering and Engineering Management]]></conf-name>
<conf-loc> </conf-loc>
<page-range>641-5</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>[38]</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[De Reyck]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Project planning with alternative technologies in uncertain environments]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2015</year>
<volume>242</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>465-76</page-range></nlm-citation>
</ref>
<ref id="B39">
<label>[39]</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="B40">
<label>[40]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nelson]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Azaron]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Aref]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The use of a GERT based method to model concurrent product development processes]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2016</year>
<volume>250</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>566-78</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>[41]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nasr]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yassine]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Abou Kasm]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An analytical approach to estimate the expected duration and variance for iterative product development projects]]></article-title>
<source><![CDATA[Res Eng Des]]></source>
<year>2016</year>
<volume>27</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>55-71</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>[42]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Xi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An agent-based simulation system for multi-project scheduling under uncertainty]]></article-title>
<source><![CDATA[Simul Model Pract Theory]]></source>
<year>2018</year>
<volume>86</volume>
<page-range>187-203</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>[43]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Elmaghraby]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the fallacy of averages in project risk management]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2005</year>
<volume>165</volume>
<page-range>307-13</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>[44]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Artigues]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Koné]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Lopez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mongeau]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Mixed-integer linear programming; formulations. Handbook on Project Management and Scheduling]]></source>
<year>2015</year>
<page-range>17-41</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>[45]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lertapiruk]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[Process improvement for new product development case study: integrated circuits chip, MSc]]></source>
<year>2014</year>
<publisher-loc><![CDATA[Bangkok, Tailandia ]]></publisher-loc>
<publisher-name><![CDATA[Faculty of Engineering, Chulalongkorn University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B46">
<label>[46]</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="B47">
<label>[47]</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="B48">
<label>[48]</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-list>
</back>
</article>
