This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame ...
The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback