Journal ArticleDOI
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
Reads0
Chats0
TLDR
A comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves is carried out.About:
This article is published in European Journal of Operational Research.The article was published on 2004-06-01. It has received 441 citations till now. The article focuses on the topics: Job shop scheduling & Local search (optimization).read more
Citations
More filters
Journal ArticleDOI
Comparison among five evolutionary-based optimization algorithms
TL;DR: Comparisons among the formulation and results of five recent evolutionary-based algorithms: genetic algorithms, memetic algorithms, particle swarm, ant-colony systems, and shuffled frog leaping are compared.
Journal ArticleDOI
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more
TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
Book ChapterDOI
Ant Colony Optimization: Overview and Recent Advances
Marco Dorigo,Thomas Stützle +1 more
TL;DR: This chapter reviews developments in ACO and gives an overview of recent research trends, including the development of high-performing algorithmic variants and theoretical understanding of properties of ACO algorithms.
Journal ArticleDOI
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
TL;DR: A heuristic rule called the smallest position value (SPV) borrowed from the random key representation of Bean was developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems.
Journal ArticleDOI
A discrete version of particle swarm optimization for flowshop scheduling problems
TL;DR: A PSO algorithm, extended from discrete PSO, for flowshop scheduling, which incorporates a local search scheme into the proposed algorithm, called PSO-LS, and shows that the local search can be really guided by PSO in the approach.
References
More filters
Journal ArticleDOI
Ant system: optimization by a colony of cooperating agents
TL;DR: It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.
Journal ArticleDOI
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Journal ArticleDOI
MAX-MIN Ant system
Thomas Stützle,Holger H. Hoos +1 more
TL;DR: Computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that MM AS is currently among the best performing algorithms for these problems.
Journal ArticleDOI
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.