A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

By Rubén Ruiz, Thomas Stützle. European Journal of Operational Research, 2007

1,098 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The distributed permutation flowshop scheduling problem (2010, methodology): “At least, one could iterate over VND to construct a VNS or and Iterated Greedy method as shown, among others in Ruiz and Stützle (2007).”
A discrete differential evolution algorithm for the permutation flowshop scheduling problem (2007, methodology): “Ruiz & Stutzle [21] have already conducted a detailed design of experiments for parameter setting of the destruction size and the temperature parameter of the acceptance criterion.”
No-wait flowshop with separate setup times to minimize maximum lateness (2007, neutral): “[23]; Ruiz and Stützle [22]).”
An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion (2008, methodology): “Due to the simple concept and easy implementation, IGA was successfully applied to the set covering [21, 22] and flow shop scheduling problems [ 20 ].”
ATLAS: Scaffold-Free Algorithm Synthesis by LLMs via Embedding-Guided Quality-Diversity Search (2026, unknown): “For FSS, we use NEH [32], Taillard-accelerated Iterated Greedy with idle-time tie-breaking (IG-TB) [38, 45, 12], and Iterative Beam Search [24].”