Evaluate Flexible Job Scheduling Problem Using Elitist Ant

Abstract

One significant approach that is frequently utilized in many applications, particularly in industry, is scheduling .An extension of job scheduling, the Flexible Job Shop Scheduling Problem (FJSP), has a number of real-world uses .This subject has received a lot of attention due to its significance and complexity .This research discusses the importance of scheduling in real-life operations, particularly in production scheduling. It presents a model using Elitist Ant (EAS) to compute the maximum value (makspane) of the flexible job shop scheduling problem(FJSP). The model programmed by Python ver. (3.) with two instance from Brandimarte dataset to optimize logistics costs and meet customer demand. The study deduce that there are two relations by using two new formula. Firstly, the relation between number of elitist ant and total ants . Also, the evaporate value is effected by the first relation directly.