A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms applied to the continuous flow shop problem
Computers and Industrial Engineering
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
Computers and Industrial Engineering
An effective hybrid optimization strategy for job-shop scheduling problems
Computers and Operations Research
Journal of Global Optimization
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
SIAM Journal on Discrete Mathematics
Differential Evolution Training Algorithm for Feed-Forward Neural Networks
Neural Processing Letters
New heuristics for no-wait flowshops to minimize makespan
Computers and Operations Research
Some local search algorithms for no-wait flow-shop problem with makespan criterion
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
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Approximative procedures for no-wait job shop scheduling
Operations Research Letters
Computers and Operations Research
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
International Journal of Bio-Inspired Computation
A differential evolution approach for NTJ-NFSSP with SDSTs and RDs
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
Flexible job shop scheduling using hybrid differential evolution algorithms
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper proposes an effective hybrid differential evolution (HDE) for the no-wait flow-shop scheduling problem (FSSP) with the makespan criterion, which is a typical NP-hard combinational optimization problem. Firstly, a largest-order-value (LOV) rule is presented to transform individuals in DE from real vectors to job permutations so that the DE can be applied for solving FSSPs. Secondly, the DE-based parallel evolution mechanism and framework is applied to perform effective exploration, and a simple but efficient local search developed according to the landscape of FSSP is applied to emphasize problem-dependent local exploitation. Thirdly, a speed-up evaluation method and a fast Insert-based neighborhood examining method are developed based on the properties of the no-wait FSSPs. Due to the hybridization of DE-based evolutionary search and problem-dependent local search as well as the utilization of the speed-up evaluation and fast neighborhood examining, the no-wait FSSPs can be solved efficiently and effectively. Simulations and comparisons based on well-known benchmarks demonstrate the efficiency, effectiveness, and robustness of the proposed HDE.