<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462020000100097</article-id>
<article-id pub-id-type="doi">10.13053/cys-24-1-3191</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An Integer Linear Programming Model for a Case Study in Classroom Assignment Problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Urbán Rivero]]></surname>
<given-names><![CDATA[Luis Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Benítez Escárcega]]></surname>
<given-names><![CDATA[Maite Regina]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[Jonas]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Centro de Investigación en Matemáticas  ]]></institution>
<addr-line><![CDATA[Aguascalientes ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma de Querétaro Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</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>24</volume>
<numero>1</numero>
<fpage>97</fpage>
<lpage>104</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462020000100097&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462020000100097&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462020000100097&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The management of human and physical resources of a university is a complex additive activity because in many cases the number of variables to be considered are many, which produces errors of the decision maker. Deciding in which classrooms the courses should be taught seems a simple task but in reality, it is complicated by a large number of courses that occur during a period in the university, the availability of personnel and the limited physical infrastructure. In this paper, we propose an integer programming model that avoids the problems of overlapping courses, besides ensuring that courses can be given in the appropriate classrooms. The model shown here was used for the planning of the 2019 courses at the Faculty of Engineering of the Autonomous University of Queretaro. An improvement in the planning time was obtained, which went from approximately 20 days manually to only a half hour as mentioned by the authorities of the University. The decision maker reports that even with the last minute changes the whole process takes no more than two days.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Timetabling]]></kwd>
<kwd lng="en"><![CDATA[ILP]]></kwd>
<kwd lng="en"><![CDATA[MAP]]></kwd>
<kwd lng="en"><![CDATA[assignment]]></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[Bakir]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Aksop]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A 0-1 integer programming approach to a university timetabling problem]]></article-title>
<source><![CDATA[Hacettepe Journal of Mathematics and Statistics]]></source>
<year>2008</year>
<volume>37</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>41-55</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[Brailsford]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Potts]]></surname>
<given-names><![CDATA[C. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[B. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Constraint satisfaction problems: Algorithms and applications]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>1999</year>
<volume>119</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>557-81</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[Burke]]></surname>
<given-names><![CDATA[E. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Petrovic]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Recent research directions in automated timetabling]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2002</year>
<volume>140</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>266-80</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[Carter]]></surname>
<given-names><![CDATA[M. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Recent developments in practical course timetabling]]></article-title>
<source><![CDATA[international conference on the practice and theory of automated timetabling]]></source>
<year>1997</year>
<page-range>3-19</page-range><publisher-name><![CDATA[Springer]]></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[Daskalaki]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Birbas]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient solutions for a university timetabling problem through integer programming]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2005</year>
<volume>160</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>106-20</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daskalaki]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Birbas]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Housos]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An integer programming formulation for a case study in university timetabling]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2004</year>
<volume>153</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>117-35</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de Werra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An introduction to timetabling]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>1985</year>
<volume>19</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>151-62</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karp]]></surname>
<given-names><![CDATA[R. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reducibility among combinatorial problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Thatcher]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Bohlinger]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Complexity of Computer Computations]]></source>
<year>1972</year>
<publisher-loc><![CDATA[Boston, MA ]]></publisher-loc>
<publisher-name><![CDATA[Springer US]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lewis]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of metaheuristic-based techniques for university timetabling problems]]></article-title>
<source><![CDATA[OR spectrum]]></source>
<year>2008</year>
<volume>30</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>167-90</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[Munkres]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for the assignment and transportation problems]]></article-title>
<source><![CDATA[Journal of the Society for Industrial and Applied Mathematics]]></source>
<year>1957</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>32-8</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez Pérez]]></surname>
<given-names><![CDATA[S. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Valencia]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez Zaragoza]]></surname>
<given-names><![CDATA[F. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new local search heuristic for the multidimensional assignment problem]]></article-title>
<source><![CDATA[NEO 2016]]></source>
<year>2018</year>
<page-range>183-202</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez Pérez]]></surname>
<given-names><![CDATA[S. L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Personnel assignment problems through the multidimensional assignment problem]]></source>
<year>2017</year>
<publisher-name><![CDATA[Universidad Autónoma Metropolitana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schaerf]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of automated timetabling]]></article-title>
<source><![CDATA[Artificial intelligence review]]></source>
<year>1999</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>87-127</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valencia]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[F. J. Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Perez]]></surname>
<given-names><![CDATA[S. L. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simple but effective memetic algorithm for the multidimensional assignment problem]]></article-title>
<source><![CDATA[2017 14th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)]]></source>
<year>2017</year>
<page-range>1-6</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
