Ant colony algorithm for multi-criteria job shop scheduling to minimize makespan, mean flow time and mean tardiness

摘要

In the real world situation many scheduling problems faced by decision maker are involved more than one aspect and therefore multiple criteria analysis is required. This paper presents ant colony algorithm for solving the multi-objective Job Shop Scheduling Problem (JSP). The objectives considered in this study include the minimization of makespan, mean flow time, and mean tardiness. The proposed algorithm is tested on many benchmark problems up to 15 jobs × 10 machine. The results obtained have shown that the proposed algorithm is a feasible and effective approach for the multiple-objective problem.