Problem over CSP

[anil kumar lenka]

Hi,

  I am a research scholar of IIT, kahargpur.India.I am doing my research over Distributed constraint satisfaction problem. Now I am thinking about the time tabling problem how can implement in CSP. Which is make me some problem to formulate time table problem to CSP problem so I request you taking the below variables, domains and constraints how I can formulate a graph or CSP in mathematical expression. The problem is  

 To allocate the time slot to different courses using these data and condition

 1. N is the number of courses (c1,c2,c3,
.cN).

2. P is the number of time slot (t1,t2,t3,

tp).

3.D is the number of days the class is going on (M,Tu,W,Th,F)

4. ln is the number of lectures of the course n, n=1,...,N, that have to take place during P time slots.

5.T is the number of Teachers( T1,T2,T3,

Tt)  

6. R  is the number of rooms(R1,R2,R3
.Rr)  available at period p .

7. d is the number section(d1,d2


..,dd) 

 8. cnm, is the number of students taking both courses n and m where n, m =1,...,N .

 like the data is available and the constraints are 

 A teacher cannot be at two places at the same time, so do not clash courses of a teacher. There should be at least a one hour break between two courses of a teacher. 

   Some teachers prefer certain times or days for teaching. 
   a room can only host one lecture at a time.
   some room having limited capacity 
   Two lectures about a same subject must not be schedule on the same time.
   All courses should be scheduled between 9 am to 6 pm and period time is 1 hour.
   Monday afternoon is reserved for professors’ meetings: Do not schedule professors’ courses for Monday afternoon. 
   The department consists of five units, each dedicated to a certain area of research. Most courses are held by members of a single unit while only a few courses are held by members of different units. Courses held by members of a certain unit must not clash with courses held by other members of the same unit. 
    Only few of the courses are mandatory for and dedicated to students of a certain term while most courses are optional and open to all students. For each term of the undergraduate studies there is a set of mandatory courses, the attendance of which is highly recommended. Courses of the graduate studies only rely on the knowledge provided by courses of the undergraduate studies. There is no recommended order of attendance. A term’s undergraduate courses must not clash, while different term’s undergraduate courses are allowed to clash. Graduate courses should not clash.

 and so on..

 Like this there are so many constraint are there so I request to you taking the above number of variable and also number of constraint how I can represent the problem in graphically and also constraint satisfaction problem (CSP) form please guide me over it.

 CSP

 V={v1,v2,v3,v4,


vk}

D={D1,D2,D3,D4,

.DK)

 Where D1 set of courses, D2 set of time slot D3 set of days and so on... So please suggest me how I can represent this problem express in mathematical and graphically.

 With best regards

 Anil

 







Yahoo! India Matrimony: Find your life partneronline.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.gforge.info.ucl.ac.be/pipermail/mozart-users/attachments/20040827/f2f4cb1e/attachment.html