An Improved Ant Colony Algorithm Based Dynamic Scheduling Method in Job Shop with Parallel Machines

Abstract

In this paper, the authors analysed the impact of machine breakdowns in job shop scheduling problem with parallel machines. A mathematical model with the objective of minimizing the weighted value of makespan and early due date was established. An improved ant colony dynamic scheduling algorithm combined with elite strategy and max-min ant mechanism was designed. Simulation experiments were designed and numerical results verified the superiority of the proposed approach.