Timetabling problem is a complex task that is performed by a number of institutions worldwide, which has been usually addressed as an optimization problem where every approach considers the particular constraints of each institution under consideration. In this paper, we describe, model, and propose a solution to the timetabling problem at the División Académica de Ciencias y Tecnologías de la Información of the Universidad Juárez Autónoma de Tabasco (UJAT), México. We modeled the specific constraints of this problem instance using the Object Constraint Language (OCL) of the Unified Modeling Language (UML), and we validated the model while using the state-of-the-art tool USE: UML-based Specification Environment. The solution strategy tackles the problem in two stages: (1) ACA: academic assignments, i.e., assign lectures to professors and (2) TTP: the timetabling process. We developed a Tabu Search customization named Tabu Search with Probabilistic Aspiration Criterion (TS-PAC) in order to solve the timetabling problem, and we developed a software prototype to test our proposal. Two feasible timetables for two different semesters were obtained according to the modeled constraints.

中文翻译：

---

建模和解决拉丁美洲大学课程时间表问题实例

时间表问题是一项复杂的任务，由全球许多机构执行，通常已作为优化问题解决，其中每种方法都考虑了所考虑的每个机构的特定约束。在本文中，我们描述，建模并提出墨西哥塔拉斯科大学（UJAT）信息科学与技术学院（DJ）的时间表问题的解决方案。我们使用统一建模语言（UML）的对象约束语言（OCL）为该问题实例的特定约束建模，并使用最新工具USE：基于UML的规范环境对模型进行了验证。解决方案策略分两个阶段解决问题：（1）ACA：学术作业，即为教授授课；（2）TTP：时间表的过程。为了解决时间表问题，我们开发了一个名为Tabu Search的Tabu Search自定义项，它具有概率愿望准则（TS-PAC），并开发了一个软件原型来测试我们的建议。根据建模的约束条件，获得了两个不同学期的两个可行时间表。