- #1
nomadreid
Gold Member
- 1,670
- 204
- TL;DR Summary
- I am not a programmer, so I am not looking for coding, but rather a general strategy for instructions for a programmer to set up a scheduling program which will schedule, say, 11 teachers, with 12 different preference criteria (some binary, some multiple values), and some teachers having seniority over others. More details in main text.
A computer program that was supposed to handle this was bought and tried, and it made a mess of it, so the idea is that perhaps it would be easier to give a strategy to someone (computer savvy, but an amateur, not a professional ) to program (not requiring too much power of the computer on which it is run).
The ideas I have so far are unfortunately vague -- if I had a more concise idea, I would not be asking here.
Numbers 10, 12 are used as examples; the real values will be close to them.
A brute force scheduling would be to make a 11 by 12 table, with teachers 1 through 10 listed in order of seniority, and list the options/constraints (choice of class [whereby also if a teacher has taught a class before, this would give her a bump up in the seniority for getting her choice ] which campus (out of two), 4 days or 2 days a week, time of day, etc. , and then slosh through it by hand. But there lies madness. Somehow making up a tree based on seniority and option importance, or a bubble sorting, or something (matrices? No idea how that would work), would be a better idea. Or any other suggestion.
One could give an example (but not in code, please) with a toy situation, say three teachers and three options, or something to that effect. Any links to freely available sites with ideas or methods (not products) would also be appreciated.
If the question is too vague, or belongs in another rubric, then I will gratefully accept any action by a moderator. Thanks.
The ideas I have so far are unfortunately vague -- if I had a more concise idea, I would not be asking here.
Numbers 10, 12 are used as examples; the real values will be close to them.
A brute force scheduling would be to make a 11 by 12 table, with teachers 1 through 10 listed in order of seniority, and list the options/constraints (choice of class [whereby also if a teacher has taught a class before, this would give her a bump up in the seniority for getting her choice ] which campus (out of two), 4 days or 2 days a week, time of day, etc. , and then slosh through it by hand. But there lies madness. Somehow making up a tree based on seniority and option importance, or a bubble sorting, or something (matrices? No idea how that would work), would be a better idea. Or any other suggestion.
One could give an example (but not in code, please) with a toy situation, say three teachers and three options, or something to that effect. Any links to freely available sites with ideas or methods (not products) would also be appreciated.
If the question is too vague, or belongs in another rubric, then I will gratefully accept any action by a moderator. Thanks.