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
Computers and Operations Research
Swarm intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Design and Analysis of Experiments
Design and Analysis of Experiments
Approximative procedures for no-wait job shop scheduling
Operations Research Letters
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A discrete particle swarm optimization algorithm for uncapacitated facility location problem
Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
Optimization in water systems: a PSO approach
Proceedings of the 2008 Spring simulation multiconference
Introducing dynamic diversity into a discrete particle swarm optimization
Computers and Operations Research
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Computers and Industrial Engineering
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Computers and Operations Research
A discrete particle swarm optimization algorithm for scheduling parallel machines
Computers and Industrial Engineering
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Computers and Operations Research
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
Computers and Operations Research
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
The circular discrete particle swarm optimization algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
A novel set-based particle swarm optimization method for discrete optimization problems
IEEE Transactions on Evolutionary Computation
A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow
Computers and Operations Research
An island model for the no-wait flow shop scheduling problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Solving no-wait flow shop scheduling problems by a hybrid quantum-inspired evolutionary algorithm
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
A binary particle swarm optimization for continuum structural topology optimization
Applied Soft Computing
Solving ring loading problems using bio-inspired algorithms
Journal of Network and Computer Applications
Microprocessors & Microsystems
Polynomial modeling for time-varying systems based on a particle swarm optimization algorithm
Information Sciences: an International Journal
Information Sciences: an International Journal
Optimal design of truss-structures using particle swarm optimization
Computers and Structures
Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
Computers and Operations Research
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Journal of Heuristics
New VNS heuristic for total flowtime flowshop scheduling problem
Expert Systems with Applications: An International Journal
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Identification of surgical practice patterns using evolutionary cluster analysis
Mathematical and Computer Modelling: An International Journal
Meta-heuristic algorithms for solving a fuzzy single-period problem
Mathematical and Computer Modelling: An International Journal
Multi-objective no-wait hybrid flowshop scheduling problem with transportation times
International Journal of Computational Science and Engineering
Information Sciences: an International Journal
Swarm optimisation algorithms applied to large balanced communication networks
Journal of Network and Computer Applications
New Hybrid Discrete PSO for Solving Non Convex Trim Loss Problem
International Journal of Applied Evolutionary Computation
A hybrid PSO-FSVM model and its application to imbalanced classification of mammograms
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
Computers and Industrial Engineering
Computers and Industrial Engineering
A case study on using evolutionary algorithms to optimize bakery production planning
Expert Systems with Applications: An International Journal
An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop
Computers and Industrial Engineering
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems
Journal of Global Optimization
Hi-index | 0.02 |
In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The main contribution of this study is due to the fact that particles are represented as discrete job permutations and a new position update method is developed based on the discrete domain. In addition, the DPSO algorithm is hybridized with the variable neighborhood descent (VND) algorithm to further improve the solution quality. Several speed-up methods are proposed for both the swap and insert neighborhood structures. The DPSO algorithm is applied to both 110 benchmark instances of Taillard [Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64:278-85] by treating them as the no-wait flowshop problem instances with the total flowtime criterion, and to 31 benchmark instances provided by Carlier [Ordonnancements a contraintes disjonctives. RAIRO Recherche operationelle 1978;12:333-51], Heller [Some numerical experiments for an MxJ flow shop and its decision-theoretical aspects. Operations Research 1960;8:178-84], and Revees [A genetic algorithm for flowshop sequencing. Computers and Operations Research 1995;22:5-13] for the makespan criterion. For the makespan criterion, the solution quality is evaluated according to the reference makespans generated by Rajendran [A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 1994;45:472-8] whereas for the total flowtime criterion, it is evaluated with the optimal solutions, lower bounds and best known solutions provided by Fink and Vosz [Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 2003;151:400-14]. The computational results show that the DPSO algorithm generated either competitive or better results than those reported in the literature. Ultimately, 74 out of 80 best known solutions provided by Fink and Vosz [Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 2003;151:400-14] were improved by the VND version of the DPSO algorithm.