Solving the University Class Scheduling Problem Using Advanced ILP Techniques



The University Class Scheduling Problem (UCSP) is concerned with assigning a number of courses to classrooms taking into consideration constraints like classroom capacities and university regulations. The problem also attempts to optimize the performance criteria and distribute the courses fairly to classrooms depending on the ratio of classroom capacities to course enrollments. The problem is a classical scheduling problem and considered to be NP-complete. It has received some research during the past few years given its wide use in colleges and universities. Several formulations and algorithms have been proposed to solve scheduling problems, most of which are based on local search techniques. In this paper, we propose a complete approach using integer linear programming (ILP) to solve the problem. The ILP model of interest is developed and solved using the three advanced ILP solvers based on generic algorithms and Boolean Satisfiability (SAT) techniques. SAT has been heavily researched in the past few years and has lead to the development of powerful 0-1 ILP solvers that can compete with the best available generic ILP solvers. Experimental results indicate that the proposed model is tractable for reasonable-sized UCSP problems.

Download full-text


Available from: Fadi A. Aloul
  • Source
    • "The recent advances in SAT solvers as well as the availability of increasingly affordable high computational power, have allowed larger problem instances to be solved in different applications domains. Such applications include Power Optimization [5], FPGA [6], Network Intrusion [7], Access Control [8], Cryptography [9], Application Mapping [10], Genetics [11] and Scheduling [12]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Over the course of the last decade, there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the application of SAT and ILP techniques in modeling complex engineering prob-lems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads, and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper proposes the development of an improved ILP formulation of the Clustering Problem. Addition-ally, various enhancements are implemented in the form of exten-sions to the improved formulation, including the establishment of intra-cluster communication, multihop connections and the enforcement of coverage constraints. The improved formulation and enhancements are implemented in a tool designed to visually create network topologies and cluster them using state-of-the art Generic ILP and SAT solvers. Through this tool, feasibility of using the proposed formulation and enhancements in a real-life practical environment is assessed. It is observed that the Generic ILP solvers, CPLEX, and SCIP, are able to handle large network topologies, while the 0–1 SAT-based ILP solver, BSOLO, is effective at handling the smaller scale networks. It is also observed that while these enhanced formulations enable the generation of complex network solutions, and are suitable for small scale networks, the time taken to generate the corresponding solution does not meet the strict requirements of a practical environment. Index Terms— Boolean satisfiability (SAT), integer linear pro-gramming, mobile ad-hoc networks (MANETs), optimization.
    Full-text · Article · Jun 2013 · IEEE Sensors Journal
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cloud computing is a new and rapidly emerging computing paradigm where applications, data and IT services are provided over the Internet. The task-resource management is the key role in cloud computing systems. Task-resource scheduling problems are premier which relate to the efficiency of the whole cloud computing facilities. Task-resource scheduling problem is NP-complete. In this paper, we consider an approach to solve this problem optimally. This approach is based on constructing a logical model for the problem. Using this model, we can apply algorithms for the satisfiability problem (SAT) to solve the task-resource scheduling problem. Also, this model allows us to create a testbed for particle swarm optimization algorithms for scheduling workflows.
    No preview · Article · Aug 2012 · International Journal of Automation and Computing
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new heuristic based on evolutionary algorithms and applied to the university course scheduling problem, where a feasible and comfort time tables are required. Here, the idea is to use an evolution program which is a stochastic optimization strategy similar to genetic algorithms. The main difference is that evolutionary programming insists on the behavioral linkage between parents and their offspring rather than seeking to emulate specific genetic operators as observed in nature. The paper starts by defining the problem and determining the constraints under which the solution should be found. Then, the problem model is described with a set of courses, rooms, instructors, and student groups. Finally, the proposed methodology is applied on a real data set from one of the four colleges of our university. Results show that our methodology permits more robust exploration for the search space of the designated problem which gives more optimized time schedules than those performed manually. The obtained results also show that the proposed solutions can solve many registration difficulties.
    Full-text · Conference Paper · Sep 2009
Show more