Are you able to provide pointers to where I can find an algorithm for an
assignment of people to shifts? Can you point some general method in operation
research that this problem fells under? Are there suitable mailing lists /
news groups for this sort of question?
What about a suitable application?
The problem is what you can think of:
1. There is a fixed number of people.
2. They have to be assigned to shifts.
3. The assignment should be as fair as possible.
4. The process is a continuous one and has memory: that is, it is to be
repeated after a while and the assignment for a specific period can be unfair,
provided that it will be compensated during the following periods.
5. There are constraints about who can be assigned to a specific shift. These
constraints are not fixed. They change between the periods the algorithm is
applied to. Each constraint has a severity rank, by which I mean that when
there is no other choice the less severe constraints should be not full filed
before the more severe ones.
--
Shaul Karl <[EMAIL PROTECTED]>
=================================================================
To unsubscribe, send mail to [EMAIL PROTECTED] with
the word "unsubscribe" in the message body, e.g., run the command
echo unsubscribe | mail [EMAIL PROTECTED]
