Application of Improved Ant Colony Algorithm with the Characteristic of Rolling Horizon Optimization to Job Shop Scheduling Problem with E/T Constraints

The emergence and development of JIT management technology open up a hot area of recent research for the iob scheduling and production management. Ant colony optimization algorithm, which has high optimization efficiency for practical application has shown great advantages in solving the combinatorial optimization problem. An improved ant colony optimization algorithm in which the characteristic of rolling horizon optimization is introduced is proposed and successfully applied in Job Shop scheduling problem with E/T constraints. The simulation results with the evolving figure and Gantt chart provided show the efficiency of the proposed algorithm.