Using Iterated Greedy with a New Population Approach for the Flexible Jobshop Scheduling Problem

Abstract

The flexible job-shop scheduling problem (FJSP) is known as an important problem in manufacturing systems. Many methods have been proposed to solve this problem. The iterated greedy (IG) is one of those algorithms that are widely used in simpler shop scheduling problems. This research proposes a new Telescopic Population approach (TP) to assist the IG in solving the FJSP. The use of TP approach with IG provides an effective method that is also easier to reproduce. The performance of TP with IG proves that the new population approach effectively improves the performance of IG.