From Computerworld Australia comes news that researchers at the University of Sydney have developed (and, sadly, patented) an algorithm that its inventors say will schedule jobs in a way that reduces ...
The Journal of the Operational Research Society, Vol. 49, No. 11 (Nov., 1998), pp. 1130-1145 (16 pages) We have developed a Genetic algorithm (GA) for the optimisation of maintenance overhaul ...
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