A speed-up procedure for the hybrid flow shop scheduling problem

During the last decades, hundreds of approximate algorithms have been proposed in literature addressing flow-shop-based scheduling problems. In race for finding best proposals to solve these problems, speed-up procedures compute objective functions represent a key factor efficiency algorithms. This is case well-known Taillard’s accelerations traditional flow shop with makespan minimisation or several other related Despite interest proposing such methods improve algorithms, our knowledge, no procedure has so far hybrid literature. To tackle this challenge, we propose paper minimisation, which can be incorporate insertion-based neighbourhoods using complete representation solutions. embedded iterated greedy algorithm. The computational experience shows that even incorporating simple metaheuristic results outperforming problem under consideration.