<?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>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332013000200009</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Generador de modelos de simulación: Aplicaciones en scheduling]]></article-title>
<article-title xml:lang="en"><![CDATA[Simulation models generator: Applications in scheduling]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[Jaime Alberto]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castrillón]]></surname>
<given-names><![CDATA[Omar Danilo]]></given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sarache]]></surname>
<given-names><![CDATA[William Ariel]]></given-names>
</name>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Nacional de Colombia Departamento de Ingeniería Industrial ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2013</year>
</pub-date>
<volume>20</volume>
<numero>2</numero>
<fpage>231</fpage>
<lpage>241</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332013000200009&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332013000200009&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332013000200009&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[El objetivo del presente trabajo es divulgar entre la comunidad académica un prototipo informático que genera automáticamente modelos de simulación de un sistema de producción industrial dado, en aras de facilitar el aprendizaje de algunosmodelos determinísticos y estocásticos de scheduling. La arquitectura básica del prototipo informático se desarrolló en términos de las capas de presentación, procesamiento y almacenamiento. A través de la capa de procesamiento el prototipo genera un modelo de simulación que se guarda en la capa de almacenamiento y que posteriormente puede ser corrido con el fin de probar diversos modelos de scheduling del sistema de producción. La teoría de scheduling ha originado diferentes alternativas para generar las mejores soluciones a problemas de programación de producción y se propone con el desarrollo de este software probar algunas de estas alternativas mediante simulación computarizada. Entre las ventajas que la simulación trae consigo está la posibilidad de evaluar el impacto que las decisiones tomadas tendrán, para así tener un acercamiento a la realidad que permita evaluar las decisiones con vistas a tomar la más asertiva. Para la prueba del prototipo se utilizó como ejemplo el modelamiento de un sistema de producción con 9 máquinas y 5 trabajos, según una configuración Job Shop, probando tiempos de procesamiento y paradas de máquinas estocásticos con el fin de medir tasas de utilización de máquinas y tiempo promedio de los trabajos en el sistema, como medidas de desempeño del sistema. Esta prueba muestra la bondad del prototipo, al ahorrarle al usuario la construcción del modelo de simulación.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[The aim of this study is to disseminate the academic community a prototype computer that automatically generates simulation models of a given industrial production system, in order to facilitate the learning of some deterministic and stochastic scheduling. The basic architecture of the prototype computer developed in terms of presentation layers, processing and storage. Through the processing layer generates a prototype simulation model which is stored in the storage layer and subsequently can be run in order to test various models of production scheduling system. Scheduling theory has led to alternatives to generate the best solutions to problems of production scheduling and intends to develop this software to test some of these alternatives by computer simulation. Among the benefits that simulation brings is the ability to assess the impact that decisions will, in order to have an approach to reality to evaluate decisions in order to take more assertive. To test prototype was used as the modeling example of a production system with 9 machines and 5 works as a job shop configuration, testing stops processing times and stochastic machine to measure rates of use of machines and time average jobs in the system, as measures of system performance. This test shows the goodness of the prototype, to save the user the simulation model building]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[simulación]]></kwd>
<kwd lng="es"><![CDATA[scheduling]]></kwd>
<kwd lng="es"><![CDATA[programación de producción]]></kwd>
<kwd lng="es"><![CDATA[sistema de producción]]></kwd>
<kwd lng="en"><![CDATA[simulation]]></kwd>
<kwd lng="en"><![CDATA[scheduling]]></kwd>
<kwd lng="en"><![CDATA[production system]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <div style="text-align: justify;">     <div style="text-align: center;"><font style="font-weight: bold;"  size="4"><span style="font-family: verdana;">Generador de modelos de simulaci&oacute;n. Aplicaciones en scheduling </span></font><br  style="font-family: verdana; font-weight: bold;"> <br style="font-family: verdana; font-weight: bold;"> <font style="font-weight: bold;" size="4"><span  style="font-family: verdana;">Simulation models generator. Applications in scheduling</span></font><br  style="font-family: verdana;"> </div> <br style="font-family: verdana;">     <div style="text-align: center;">     <div style="text-align: left;">     <div style="text-align: center;"><font size="2"><span  style="font-family: verdana;">Jaime Alberto Giraldo<sup><a href="#1">*</a><a name="4"></a>+</sup>, Omar Danilo Castrill&oacute;n<sup><a href="#2">&#8224;</a><a name="5"></a>+</sup>, William Ariel Sarache<sup><a href="#3">&#8225;</a><a name="6"></a>+</sup></span></font>    <br> <font size="2"><span style="font-family: verdana;"></span></font></div> <font size="2"><span style="font-family: verdana;"></span></font><font  size="2"><span style="font-family: verdana;"></span></font></div> </div> <font size="2"><span style="font-family: verdana;">    <br> <a name="Correspondencia2"></a>*<a href="#Correspondencia1">Direcci&oacute;n para correspondencia:</a><br style="font-family: verdana;"> </span></font> <hr style="width: 100%; height: 2px;"><font size="3"><span  style="font-family: verdana; font-weight: bold;">Resumen</span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">El objetivo del presente trabajo es divulgar entre la comunidad acad&eacute;mica un prototipo inform&aacute;tico que genera autom&aacute;ticamente modelos de simulaci&oacute;n de un sistema de producci&oacute;n industrial dado, en aras de facilitar el aprendizaje de algunosmodelos determin&iacute;sticos y estoc&aacute;sticos de <span  style="font-style: italic;">scheduling</span>. La arquitectura b&aacute;sica del prototipo inform&aacute;tico se desarroll&oacute; en t&eacute;rminos de las capas de presentaci&oacute;n, procesamiento y almacenamiento. A trav&eacute;s de la capa de procesamiento el prototipo genera un modelo de simulaci&oacute;n que se guarda en la capa de almacenamiento y que posteriormente puede ser corrido con el fin de probar diversos modelos de <span style="font-style: italic;">scheduling</span> del sistema de producci&oacute;n. La teor&iacute;a de <span style="font-style: italic;">scheduling</span> ha originado diferentes alternativas para generar las mejores soluciones a problemas de programaci&oacute;n de producci&oacute;n y se propone con el desarrollo de este <span  style="font-style: italic;">software</span> probar algunas de estas alternativas mediante simulaci&oacute;n computarizada. Entre las ventajas que la simulaci&oacute;n trae consigo est&aacute; la posibilidad de evaluar el impacto que las decisiones tomadas tendr&aacute;n, para as&iacute; tener un acercamiento a la realidad que permita evaluar las decisiones con vistas a tomar la m&aacute;s asertiva. Para la prueba del prototipo se utiliz&oacute; como ejemplo el modelamiento de un sistema de producci&oacute;n con 9 m&aacute;quinas y 5 trabajos, seg&uacute;n una configuraci&oacute;n <span  style="font-style: italic;">Job Shop</span>, probando tiempos de procesamiento y paradas de m&aacute;quinas estoc&aacute;sticos con el fin de medir tasas de utilizaci&oacute;n de m&aacute;quinas y tiempo promedio de los trabajos en el sistema, como medidas de desempe&ntilde;o del sistema. Esta prueba muestra la bondad del prototipo, al ahorrarle al usuario la construcci&oacute;n del modelo de simulaci&oacute;n.</span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;"><span  style="font-weight: bold;">Palabras clave: </span>simulaci&oacute;n, scheduling, programaci&oacute;n de producci&oacute;n, sistema de producci&oacute;n.</span></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-weight: bold;" size="3"><span  style="font-family: verdana;">Abstract </span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">The aim of this study is to disseminate the academic community a prototype computer that automatically generates simulation models of a given industrial production system, in order to facilitate the learning of some deterministic and stochastic scheduling. The basic architecture of the prototype computer developed in terms of presentation layers, processing and storage. Through the processing layer generates a prototype simulation model which is stored in the storage layer and subsequently can be run in order to test various models of production scheduling system. Scheduling theory has led to alternatives to generate the best solutions to problems of production scheduling and intends to develop this software to test some of these alternatives by computer simulation. Among the benefits that simulation brings is the ability to assess the impact that decisions will, in order to have an approach to reality to evaluate decisions in order to take more assertive. To test prototype was used as the modeling example of a production system with 9 machines and 5 works as a job shop configuration, testing stops processing times and stochastic machine to measure rates of use of machines and time average jobs in the system, as measures of system performance. This test shows the goodness of the prototype, to save the user the simulation model building</span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;"><span  style="font-weight: bold;">Keywords:</span> simulation, scheduling, production system.</span></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;"><span  style="font-weight: bold;">Mathematics Subject Classification:</span> 90B36.</span></font><br style="font-family: verdana;"> <hr style="width: 100%; height: 2px;">    <br> <span  style="color: rgb(0, 0, 0); font-family: verdana; font-size: small; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; background-color: rgb(255, 255, 255); display: inline ! important; float: none;">Ver contenido disponible en pdf<span class="Apple-converted-space">     <br> <br style="font-family: verdana;"> </span></span> <hr style="width: 100%; height: 2px;">    <!-- ref --><br> <font size="3"><span style="font-family: verdana; font-weight: bold;">Referencias</span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[1] Castrill&oacute;n, O.D.; Giraldo, J.A.; Sarache, W.A. (2009) <span style="font-style: italic;">T&eacute;cnicas de Programaci&oacute;n de la Producci&oacute;n. Aplicaciones en Ambientes Job Shop.</span> Unibiblos. Bogot&aacute;, Colombia.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957688&pid=S1409-2433201300020000900001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[2] Castrill&oacute;n, O.D.; Giraldo, J.A.; Sarache, W.A. (2010) <span style="font-style: italic;">T&eacute;cnicas Inteligentes y Estoc&aacute;sticas en Scheduling. Un Enfoque en la Producci&oacute;n y las Operaciones.</span> Unibiblos, Bogot&aacute;, Colombia.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957689&pid=S1409-2433201300020000900002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[3] Dom&iacute;nguez, J.A.; &Aacute;lvarez A.; Dom&iacute;nguez M.A.; Garc&iacute;a, S.; Ruiz, A. (1995) <span style="font-style: italic;">Direcci&oacute;n de Operaciones. Aspectos Estrat&eacute;gicos en la Producci&oacute;n y los Servicios.</span> Mac Graw Hill, Madrid.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957690&pid=S1409-2433201300020000900003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[4] Graham, R.L.; Lawler, E.L.; Lenstra, J.K.; Rinooy Kan, A.H.G. (1979) Optimization and aproximation in deterministic sequencing and <span style="font-style: italic;">scheduling</span>: a survey. <span style="font-style: italic;">Annals of Discrete Mathematics</span> 5: 287&#8211;326.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957691&pid=S1409-2433201300020000900004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[5] Leung, J.; Pinedo, L. (2003) &#8220;Minimizing total completion time on parallel machines with deadline constraints&#8221;, <span style="font-style: italic;">SIAM Journal Computing</span> 32(5): 1370&#8211;1388.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957692&pid=S1409-2433201300020000900005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[6] Miltenburg, J. (2005) <span style="font-style: italic;">Manufacturing Strategy. How to Formulate and Implement a Winning Plan</span>. Productivity Press, Portly OR.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957693&pid=S1409-2433201300020000900006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[7] Russell, R.; Taylor III, B. (2003) <span style="font-style: italic;">Operations Management</span>, 4th Ed. Prentice Hall, New Jersey.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1957694&pid=S1409-2433201300020000900007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><br>     <br> <a name="Correspondencia1"></a><a href="#Correspondencia2">*</a>Correspondencia a:    <br> </span></font><font size="2"><span style="font-family: verdana;"></span></font><font  size="2"><span style="font-family: verdana;">Jaime Alberto Giraldo. </span></font><font  size="2"><span style="font-family: verdana;">Departamento de Ingenier&iacute;a Industrial, Universidad Nacional de Colombia, Sede Manizales, Colombia. E-Mail: <a href="mailto:Jaiagiraldog@unal.edu.co">J</a>aiagiraldog@unal.edu.co</span></font><br  style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">Omar Danilo Castrill&oacute;n. </span></font><font size="2"><span  style="font-family: verdana;">Misma direcci&oacute;n que/Same address as: J.A. Giraldo. E-Mail: Odcastrillong@unal.edu.co</span></font><br  style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">William Ariel Sarache. </span></font><font size="2"><span  style="font-family: verdana;">Misma direcci&oacute;n que/Same address as: J.A. Giraldo. E-Mail: Wasarachec@unal.edu.co    <br> </span></font><font size="2"><span style="font-family: verdana;"><a  name="1"></a><a href="#4">*</a>Departamento de Ingenier&iacute;a Industrial, Universidad Nacional de Colombia, Sede Manizales, Colombia. E-Mail: Jaiagiraldog@unal.edu.co</span></font><br  style="font-family: verdana;"> <font size="2"> <span style="font-family: verdana;"><a name="2"></a><a href="#5">&#8224;</a>Misma direcci&oacute;n que/Same address as: J.A. Giraldo. E-Mail: Odcastrillong@unal.edu.co</span></font><br  style="font-family: verdana;"> <font size="2"> <span style="font-family: verdana;"><a name="3"></a><a href="#6">&#8225;</a>Misma direcci&oacute;n que/Same address as: J.A. Giraldo. E-Mail: Wasarachec@unal.edu.co</span></font><font  size="2"><span style="font-family: verdana;"></span></font><br  style="font-family: verdana; font-weight: bold;"> </div> <hr style="width: 100%; height: 2px;">     ]]></body>
<body><![CDATA[<div style="text-align: center;"><font size="2"><span  style="font-family: verdana; font-weight: bold;">Received: 18/Feb/2012; Revised: 24/Apr/2012; Accepted: 16/May/2012</span></font><br  style="font-family: verdana;"> </div>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castrillón]]></surname>
<given-names><![CDATA[O.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarache]]></surname>
<given-names><![CDATA[W.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Técnicas de Programación de la Producción: Aplicaciones en Ambientes Job Shop]]></source>
<year>2009</year>
<publisher-loc><![CDATA[^eBogotá Bogotá]]></publisher-loc>
<publisher-name><![CDATA[Unibiblos]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castrillón]]></surname>
<given-names><![CDATA[O.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarache]]></surname>
<given-names><![CDATA[W.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Técnicas Inteligentes y Estocásticas en Scheduling: Un Enfoque en la Producción y las Operaciones]]></source>
<year>2010</year>
<publisher-loc><![CDATA[^eBogotá Bogotá]]></publisher-loc>
<publisher-name><![CDATA[Unibiblos]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Domínguez]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Álvarez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Domínguez]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dirección de Operaciones: Aspectos Estratégicos en la Producción y los Servicios]]></source>
<year>1995</year>
<publisher-loc><![CDATA[^eMadrid Madrid]]></publisher-loc>
<publisher-name><![CDATA[Mac Graw Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Graham]]></surname>
<given-names><![CDATA[R.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Lawler]]></surname>
<given-names><![CDATA[E.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[J.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Rinooy Kan]]></surname>
<given-names><![CDATA[A.H.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimization and aproximation in deterministic sequencing and scheduling: a survey]]></article-title>
<source><![CDATA[Annals of Discrete Mathematics]]></source>
<year>1979</year>
<volume>5</volume>
<page-range>287-326</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leung]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinedo]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Minimizing total completion time on parallel machines with deadline constraints&#8221;]]></article-title>
<source><![CDATA[SIAM Journal Computing]]></source>
<year>2003</year>
<volume>32</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1370-1388</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[Miltenburg]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Manufacturing Strategy: How to Formulate and Implement a Winning Plan]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Portly^eOR OR]]></publisher-loc>
<publisher-name><![CDATA[Productivity Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Russell]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Taylor III]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Operations Management]]></source>
<year>2003</year>
<edition>4th</edition>
<publisher-loc><![CDATA[^eNew Jersey New Jersey]]></publisher-loc>
<publisher-name><![CDATA[Prentice Hall]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
