Browse Prior Art Database

Efficient Free Time Searching for a Group Scheduler

IP.com Disclosure Number: IPCOM000107650D
Original Publication Date: 1992-Mar-01
Included in the Prior Art Database: 2005-Mar-22
Document File: 1 page(s) / 38K

Publishing Venue

IBM

Related People

Baber, RL: AUTHOR

Abstract

Scheduling algorithms are a classic problem in computer science. Constraint resolution is a common method of solving scheduling tasks. These algorithms can be complex, however, to understand, implement and to document. For a meeting scheduler, a simple, yet efficient algorithm is needed.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 85% of the total text.

Efficient Free Time Searching for a Group Scheduler

       Scheduling algorithms are a classic problem in computer
science.  Constraint resolution is a common method of solving
scheduling tasks.  These algorithms can be complex, however, to
understand, implement and to document.  For a meeting scheduler, a
simple, yet efficient algorithm is needed.

      The solution was found by implementing common constraint
resolution algorithms using Object-Oriented programming.  It was
found, however, that by massaging the search request input by the
user, all but two of the constraints could be discarded, making the
process much simpler to understand and more efficient to execute.
There are three search request parameters selected by the user. They
are start time, end time and duration.  In addition, a collection of
calendar events is provided by data base query.   The time range for
the search may be modified by the algorithm in two ways:
      1)   If an event is bounded on both sides by the search
request, the request is split into two separate requests and
considered separately.  This is a key process that allows the
simplification.
      2)   If an event overlaps a request on either end, the request
is pruned at that end.  This is the first, very simple constraint,
that an event at a certain time precludes a meeting request at that
time. Obviously, the time is taken, someone is busy. All that remains
is to check that the requests have durations lo...