A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line
Computers and Industrial Engineering
Scheduling flowshops with finite buffers and sequence-dependent setup times
Computers and Industrial Engineering
Flowshop scheduling with limited temporary storage
Journal of the ACM (JACM)
Mechanical engineering design optimization by differential evolution
New ideas in optimization
Simulation in production scheduling: scheduling flow-shops with limited buffer spaces
Proceedings of the 32nd conference on Winter simulation
Multiobjective Scheduling by Genetic Algorithms
Multiobjective Scheduling by Genetic Algorithms
Journal of Global Optimization
Differential Evolution Training Algorithm for Feed-Forward Neural Networks
Neural Processing Letters
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
Computers and Operations Research
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
A differential evolution approach for the common due date early/tardy job scheduling problem
Computers and Operations Research
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
Mathematical and Computer Modelling: An International Journal
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Computers and Operations Research
A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands
Journal of Computational and Applied Mathematics
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Computers and Operations Research
The open vehicle routing problem with fuzzy demands
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
Information Sciences: an International Journal
Advances in Engineering Software
A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
Applied Soft Computing
Open vehicle routing problem with demand uncertainty and its robust strategies
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
This paper proposes an effective hybrid algorithm based on differential evolution (DE), namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) with limited buffers between consecutive machines, which is a typical NP-hard combinatorial optimization problem with strong engineering background. Firstly, to make DE suitable for solving scheduling problems, a largest-order-value (LOV) rule is presented to convert the continuous values of individuals in DE to job permutations. Secondly, after the DE-based exploration, an efficient local search, which is designed based on the landscape of MPFSSP with limited buffers, is applied to emphasize exploitation. Thus, not only does the HDE apply the parallel evolution mechanism of DE to perform effective exploration (global search) in the whole solution space, but it also adopts problem-dependent local search to perform thorough exploitation (local search) in the promising sub-regions. In addition, the concept of Pareto dominance is used to handle the updating of solutions in sense of multi-objective optimization. Moreover, the convergence property of HDE is analyzed by using the theory of finite Markov chain. Finally, simulations and comparisons based on benchmarks demonstrate the effectiveness and efficiency of the proposed HDE.