[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC |
|
| Moderator: | RUSURE::EDP |
|
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
1596.0. "Resource allocation Algorithm ?" by SNOFS2::ROY () Sat Apr 18 1992 11:33
Suppose we have a set {1,2,3...n} of n proposed activities that wish to
use a resource that can be used only by one activity at a time. Each
activity i starts at time s(i) and finishes at time f(i) if the
resource is allocated to it . Activities i and j are compatiable if
they do not overlap (ie, s(i)>=f(j) or s(j)>f(i)) . The question is how
to select a maximum-size set of mutually compatiable activities.
| T.R | Title | User | Personal
Name | Date | Lines |
|---|
| 1596.1 | See 1595.1 | VMSDEV::HALLYB | Fish have no concept of fire. | Sat Apr 18 1992 13:48 | 1 |
|
|
| 1596.2 | Its in Algorithms also | SNOFS2::ROY | | Tue Apr 21 1992 04:35 | 3 |
| I have posted the same entry in Algorithms conference.
Goutam
|
| 1596.3 | | TRACE::GILBERT | Ownership Obligates | Tue Apr 21 1992 16:20 | 44
|