EFFICIENCY ANALYSIS OF THE HILL CLIMBING AND ELITIST STRATEGY OF ANT SYSTEM IN THE APPLICATION OF FLOW SHOP SCHEDULING PROBLEMS

Abstract

This paper examines the efficiency of the Hill Climbing and Elitist Strategy of Ant System algorithms on a well-known production scheduling task, the Flow Shop Scheduling task. In the task, the properties of the machines and jobs are given and all jobs must be performed on each machine. The objective function is the makespan minimization. For this task, the researchers created benchmark datasets on which the efficiency of each algorithm can be proven. This research uses the Taillard dataset to demonstrate the efficiency of the algorithms.