A review on Elitist Ant System Algorithm and applications in Flexible Job Scheduling Problem

Scheduling is an important technique being used widely in numerous applications especially in industry .Flexible Job Shop Scheduling Problem (FJSP) is an extension of job scheduling which has several practical applications , (FJSP) is NP-hard combinatorial optimization problem. Owing to its importance and intricacy a lot of attention has been paid to this topic. Many swarm intelligent algorithms have drawn inspiration from nature; one particularly notable example is Ant Colony Optimization (ACO), which has shown to be incredibly successful and productive when applied to high-complexity(NP-hard) combinatorial optimization tasks. The paper presents a literature survey on ACO variants types and applications in Scheduling.

Abstract licence: CC BY-NC

35 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.