Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Scheduling: Theory, Algorithms, and Systems

Michael Pinedo · IIE Transactions · 1996 · 6.3K citations

Management, Computer Science, Operations Management +12

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Muhammad Nawaz, E. Emory Enscore, Inyong Ham · Omega · 1983 · 2.5K citations

Management, Industrial Engineering, Operations Management +10

Benchmarks for basic scheduling problems

Éric D. Taillard · European Journal of Operational Research · 1993 · 2.4K citations

Computing, Computer Science, Algorithms +11

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

Rubén Ruíz, Thomas Stützle · European Journal of Operational Research · 2006 · 1.1K citations

Computing, Computer Science, Industrial Engineering +14

Some efficient heuristic methods for the flow shop sequencing problem

Éric D. Taillard · European Journal of Operational Research · 1990 · 855 citations

Management, Industrial Engineering, Operations Management +12