Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach

By A. Bagheri, Mostafa Zandieh. 2011

89 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/8ebed7d74fcc883afaa91711108cbae77c9a7f83

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. Abid Ali Khan
2. Morteza Mousakhani
3. Imran Ali Chaudhry

In Industrial and Manufacturing Engineering

1. Abid Ali Khan
2. Morteza Mousakhani
3. Imran Ali Chaudhry
4. Xinyu Li
5. Liang Gao

Citations in the corpus

• A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems (2019, unknown): “3) 9 [5] [6] [89] [90] [97] [106] [118] [120] [143]”
• A research survey: review of flexible job shop scheduling techniques (2016, methodology): “…123 Amiri et al. (2010) Research VNS Makespan 35 Lei and Guo (2011) Research Swarm-based NS, FJSSP with fuzzy processing conditions Fuzzy makespan 7 Bagheri and Zandieh (2011) Research VNS, FJSSP with sequence-dependent setup times Minimum of makespan and mean tardiness 15 Zheng et al.…”
• Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness (2013, methodology): “We compare ILS against the available algorithms in the literature including tabu search (TS) proposed by Saidi-Mehrabad and Fattahi (2007) and variable neighbourhood search (VNS) proposed by Bagheri and Zandieh (2011).”