Hybrid Non-dominated Sorting Simulated Annealing Algorithm for Flexible Job Shop Scheduling Problems

Abstract

A new hybrid Non-dominated Sorting simulated annealing algorithm has been proposed to solve Multiobjective flexible job-shop scheduling problems (MOFJSPs). The multi objectives considered in this study are makespan, total workload of machines, workload of critical machines and total cost simultaneously. In this study, the critical or incapable machines are eliminated by non-dominated sorting of all operations and the initial solution is arrived using simulated annealing. A main feature of this proposed algorithm is its computational efficiency and simplicity in hybridization. The performance of the proposed algorithm is tested with flexible benchmark instances. The experimental results prove its performance by providing non-dominated solutions for both small and relatively larger cases in minimum computational time.