A Job-Shop Scheduling Method Based on Ant Colony Optimization Considering Simultaneous Processing
摘要
In this paper, Ant Colony Optimization (ACO) is used to determine whether or not to perform simultaneous processing and the combination of jobs that make up a batch in a scheduling problem to achieve the objective of minimizing the make-span. After constructing the scheduling model and decision-making model for simultaneous processing, computer experiments in conjunction with a reactive scheduling system based on genetic algorithms (GA) that considered simultaneous processing and preparatory operations of jobs are conducted to verify the effectiveness of the proposed method.