A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

611 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.

Gbest-guided artificial bee colony algorithm for numerical function optimization (2010, background): “…Academy of Sciences, Shenzhen 518055, PR China b Department of Computer Science, City University of Hong Kong, Hong Kong SAR, PR China a r t i c l e i n f o a b s t r a c t Keywords: Artificial bee colony algorithm Genetic algorithm Particle swarm optimization Differential evolution…”
Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions (2011, methodology): “ABC has been used to solve real-word problems such as flow shop scheduling problems [52], minimum spanning tree problems [65], and parameter estimation problems [27].”
An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem (2014, methodology): “The experimental results showed that the proposed EDA was more effective than discrete ABC algorithm (Pan et al. 2011), ACO (Marimulthu, Ponnambalam, and Jawahar 2009), discrete particle swarm optimisation (Tseng and Liao 2008) and hybrid GA (Yoon and Ventura 2002).”
A social spider algorithm for global optimization (2015, methodology): “gence algorithms like PSO and ABC originally designed to solve continuous optimization problems have been successfully modified to solve combinatorial problem [50][51].”