Journal ArticleDOI
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Reads0
Chats0
TLDR
The possibility of re-optimizing partial solutions obtained after the solution destruction step of the iterated greedy algorithm is explored and it is shown that with this extension, the performance of the state-of-the-art algorithm for the PFSP under makespan criterion can be significantly improved.About:
This article is published in Computers & Operations Research.The article was published on 2017-05-01. It has received 81 citations till now. The article focuses on the topics: Greedy algorithm & Greedy randomized adaptive search procedure.read more
Citations
More filters
Journal ArticleDOI
Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem
TL;DR: The results show that the proposed algorithms are very effective and efficient to solve the problem under consideration as they outperform the existing methods by a significant margin.
Journal ArticleDOI
A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times
Eliana María González-Neira,Eliana María González-Neira,Daniele Ferone,Sara Hatami,Angel A. Juan +4 more
TL;DR: The stochastic version of the DAPFSP, in which processing and assembly times are random variables is studied, with the aim of minimizing the expected makespan and considering other measures of statistical dispersion in order to account for risk.
Journal ArticleDOI
Metaheuristic algorithms for the hybrid flowshop scheduling problem
TL;DR: A mathematical model, four variants of iterated greedy algorithms and a variable block insertion heuristic for the HFSP with total flow time minimization based on the well-known NEH heuristic, an efficient constructive heuristic is also proposed, and compared with NEH.
Journal ArticleDOI
An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows
TL;DR: An Iterated Greedy algorithm, namely IG with Idle Time insertion Evaluation (IG I T E), is proposed and performance analysis shows that the IG IT E is the most appropriate for the DPFSP with due windows among the tested algorithms.
Journal ArticleDOI
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness
TL;DR: This paper addresses the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario, and proposes a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function.
References
More filters
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
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
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
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.
Journal ArticleDOI
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more