An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

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

391 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/4301b1266775682b9e3648b0667dcd776ad04f06

How researchers see this paper

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

In Computer Networks and Communications

1. Bahman Naderi
2. Quan-Ke Pan
3. Morteza Mousakhani

In Industrial and Manufacturing Engineering

1. Quan-Ke Pan
2. S. F. Fatemi Ghomi
3. Mostafa Zandieh
4. D. Gong
5. Xiaoyan Sun
6. Bahman Naderi
7. Yu-yan Han
8. Morteza Mousakhani

Citations in the corpus

• Scheduling job shop problems with sequence-dependent setup times (2009, background): “Schutten (1998) considered a job shop with some practical aspects, such as release and due date, setup times and transportation times.”
• An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem (2014, background): “Insert and swap operators are commonly used to generate neighbouring solutions for flow shop scheduling problems (Wang 2003) and have been demonstrated as superior to the inverse neighbourhood (Ruiz and Thomas 2008).”