home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!dtix!darwin.sura.net!udel!louie!eplrx7!pensak
- From: pensak@eplrx7.es.duPont.com (Dave Pensak)
- Newsgroups: comp.ai
- Subject: planning/scheduling
- Message-ID: <1992Aug17.163105.4626@eplrx7.es.duPont.com>
- Date: 17 Aug 92 16:31:05 GMT
- Organization: DuPont Central Research & Development
- Lines: 39
-
- I hope that this is not a totally ludicrous question.....
-
- We have been approached by a local psychiatric hospital to see if
- any of our scheduling folks can help them with the following problem:
-
- There are N patients
-
- There are M staff members (N >> M)
-
- There are I activities in J locations throughout the day
-
- Is there any machine assisted way to make sure that the best possible
- staff combinations are associated with the right group of patients
- throughout the day (the groupings can, and do, change during the day).
-
- The reason that I am posting the query here is that it is a generalization
- of the classic problem of the farmer moving his chickens and the wolves
- across the river. There are subgroups of patients who absolutely
- can not be left together without adequate supervision.
-
- Add to this the problem that there are (semi)random perturbations
- both throughout the day (patients wandering off...., unexpected
- medical tests, etc) and between days (staff calling in sick, etc).
-
-
- Can anyone point me to any of the following
-
- Papers/books that will enlighten me about the feasability of solving this
-
- Code that will solve even a part of this
-
- Someone who can definitively tell me the problem is too (big, amorphous,
- etc) to solve.
-
-
- This is actually a quite serious problem which is causing great hardships
- amongst the staff and patients.
-
- Thanks in advance for any insights you can offer.
-