Soft Scheduling

Details Soft Scheduling Soft Scheduling

2001-06-02

arxiv.org/abs/cs/0106004v1

Computer Science

Artificial Intelligence

10 pages; accepted to the Sixth Annual Workshop of the ERCIM Working Group on Constraints

Scientific paper

Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masaryk University considering individual course requirements of students demonstrate practical problems which are solved via proposed methods. Implementation of general preference constraint solver is discussed and first computational results for timetabling problem are presented.

Affiliated with

Also associated with

No associations

Rating

Soft Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Soft Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Soft Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405899