The Three-Machine No-Wait Flow Shop is NP-Complete
Journal of the ACM (JACM)
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Journal of Global Optimization
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 discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Computers and Operations Research
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
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Approximative procedures for no-wait job shop scheduling
Operations Research Letters
Bi-Objective Ant Colony Optimization approach to optimize production and maintenance scheduling
Computers and Operations Research
A differential evolution algorithm with self-adapting strategy and control parameters
Computers and Operations Research
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
A differential evolution algorithm for lot-streaming flow shop scheduling problem
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Some heuristics for no-wait flowshops with total tardiness criterion
Computers and Operations Research
Expert Systems: The Journal of Knowledge Engineering
Efficient methods to schedule reentrant flowshop system
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.01 |
This paper presents a novel discrete differential evolution (DDE) algorithm for solving the no-wait flow shop scheduling problems with makespan and maximum tardiness criteria. First, the individuals in the DDE algorithm are represented as discrete job permutations, and new mutation and crossover operators are developed based on this representation. Second, an elaborate one-to-one selection operator is designed by taking into account the domination status of a trial individual with its counterpart target individual as well as an archive set of the non-dominated solutions found so far. Third, a simple but effective local search algorithm is developed to incorporate into the DDE algorithm to stress the balance between global exploration and local exploitation. In addition, to improve the efficiency of the scheduling algorithm, several speed-up methods are devised to evaluate a job permutation and its whole insert neighborhood as well as to decide the domination status of a solution with the archive set. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed DDE algorithm is superior to a recently published hybrid differential evolution (HDE) algorithm [Qian B, Wang L, Huang DX, Wang WL, Wang X. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research 2009;36(1):209-33] and the well-known multi-objective genetic local search algorithm (IMMOGLS2) [Ishibuchi H, Yoshida I, Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 2003;7(2):204-23] in terms of searching quality, diversity level, robustness and efficiency. Moreover, the effectiveness of incorporating the local search into the DDE algorithm is also investigated.