2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
using parameters made available by CLS, we compare the performance of the base line approach that uses ILOG CPLEX implementation of the Integer programming algorithm with one that uses heuristics. The results show that the heuristic approach runs faster than the base-line, but at the cost of producing a less optimal scheduling solution. An obvious advantage of the study presented in this paper is that the automatic scheduling can handle more scheduling conditions and constraints than humans are able to handle manually and can reach optimal solutions. As far as we know, this is the first attempt to propose an automatic scheduling approach for synchrotron facilities like CLS around the world.