The International Timetabling Competition 2019 (ITC 2019) posed a university timetabling problem involving assigning classes to times and rooms for an entire semester while students required classes. We propose new mixed integer programming (MIP) formulation of the problem. MIP takes advantage different graph structures in conflict graphs construct strong constraints. In addition, we introduce ...

In this paper, we concentrate on a typical scheduling problem: the computation of a timetable for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search str...

A constraint satisfaction problem (CSP) requires a value, selected from a given ®nite domain, to be assigned to each variable in the problem, so that all constraints relating the variables are satis®ed. Many combinatorial problems in operational research, such as scheduling and timetabling, can be formulated as CSPs. Researchers in arti®cial intelligence (AI) usually adopt a constraint satisfac...

Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...

The Constraint Satisfaction Problem (CSP) is a very general problem able to conveniently formulate a wide range of important applications in combinatorial optimization. These include well-known classical problems such as graph k-coloring and satisfiability, as well as many practical applications related to resource assignments, planning and timetabling. The feasibility problem of Integer Progra...

This paper addresses a nurse scheduling problem that is present in hospital. In order to accommodate the rising cost of sustaining and maintaining hospital, there demand analyse manpower by not compromising needs patients. Therefore, this study aims apply mathematical method find optimal number nurses be assigned for duties each day shift An integer linear programming model developed represent ...