An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Computers and Operations Research
A discrete version of particle swarm optimization for flowshop scheduling problems
Computers and Operations Research
A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods
Computers and Industrial Engineering
An improved NEH heuristic to minimize makespan in permutation flow shops
Computers and Operations Research
Ant colony optimization for multi-objective flow shop scheduling problem
Computers and Industrial Engineering
A combinatorial particle swarm optimisation for solving permutation flowshop problems
Computers and Industrial Engineering
A Constructive Genetic Algorithm for permutation flowshop scheduling
Computers and Industrial Engineering
Computers and Operations Research
An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model
Expert Systems with Applications: An International Journal
A multi-objective ant colony system algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
Computers and Industrial Engineering
The circular discrete particle swarm optimization algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Comparing three-step heuristics for the permutation flow shop problem
Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A case study on using evolutionary algorithms to optimize bakery production planning
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The problem of scheduling in permutation flow shop with the objective of minimizing the maximum completion time, or makespan, is considered. A new ant colony optimization algorithm is developed for solving the problem. A novel mechanism is employed in initializing the pheromone trails based on an initial sequence. Moreover, the pheromone trail intensities are limited between lower and upper bounds which change dynamically. When a complete sequence of jobs is constructed by an artificial ant, a local search is performed to improve the performance quality of the solution. The proposed ant colony algorithm is applied to Taillard's benchmark problems. Computational experiments suggest that the algorithm yields better results than well-known ant colony optimization algorithms available in the literature.