An Artificial Bee Colony Algorithm Based on Problem Data Properties for Scheduling Job Shops

摘要

To solve the job shop scheduling problem with the objective of minimizing total weighted tardiness, an artificial bee colony algorithm based on problem data analysis is proposed. First, characteristic values are defined to describe the criticality of each job in the process of scheduling and optimization. Then, a fuzzy inference system is employed to evaluate the characteristic values according to practical scheduling knowledge. Finally, a local search mechanism is designed based on the idea that critical jobs should be processed with higher priority. Numerical computations are conducted with an artificial bee colony algorithm which integrates the local search module. The computational results for problems of different sizes show that the proposed algorithm is both effective and efficient.