The distributed permutation flowshop scheduling problem

By Bahman Naderi, Rubén Ruiz. Computers & Operations Research, 2010

530 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/196025435092999f7ca0048be0c92ce91ce778f7

How researchers see this paper

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

In Industrial and Manufacturing Engineering

1. Quan-Ke Pan
2. Bahman Naderi
3. Rubén Ruiz
4. Carlos Andrés-Romano
5. Sara Hatami
6. Morteza Mousakhani

Citations in the corpus

• Iterated Greedy methods for the distributed permutation flowshop scheduling problem (2019, methodology): “634 We have observed how since the initial work of Naderi and Ruiz (2010), the 635 state-of-the-art has improved considerably. Naderi and Ruiz (2014) managed 636 to improve all 720 best upper bounds of the original results of Naderi and Ruiz 637 (2010) and now with the results of the proposed IG2S, ”
• The Distributed Assembly Permutation Flowshop Scheduling Problem (2013, methodology): “As mentioned in the paper of Naderi and Ruiz (2010), the DPFSP is an NP-Complete problem (if n > f ); accordingly, the DAPFSP with an additional assembly stage as a further stage is certainly a NP-complete problem. Therefore, it is necessary to develop a heuristic approach to solve large-sized probl”