Journal ArticleDOI
An iterated greedy algorithm for the flowshop scheduling problem with blocking
Reads0
Chats0
TLDR
In this paper, an iterated greedy algorithm for solving the blocking flow shop scheduling problem for makespan minimization is proposed, and an improved NEH-based heuristic is used as the initial solution procedure.Abstract:
This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flowshop instances. The experimental evaluation showed the efficiency of the proposed algorithm, in spite of its simple structure, in comparison with a state-of-the-art algorithm. In addition, new best solutions for Taillard’s instances are reported for this problem, which can be used as a basis of comparison in future studies.read more
Citations
More filters
Book ChapterDOI
Iterated Local Search: Framework and Applications
TL;DR: The purpose here is to give an accessible description of the underlying principles of iterated local search and a discussion of the main aspects that need to be taken into account for a successful application of it.
Journal ArticleDOI
Carbon-efficient scheduling of flow shops by multi-objective optimization
Jian-Ya Ding,Shiji Song,Cheng Wu +2 more
TL;DR: Numerical computations show that the energy-saving module of the extended NEH-Insertion Procedure in MONEH and MMOIG significantly helps to improve the discovered front and the proposed algorithms perform more effectively than other tested high-performing meta-heurisitics in searching for non-dominated solutions.
Journal ArticleDOI
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
TL;DR: In this article, a distributed permutation flow shop scheduling problem is addressed, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flow shop.
Journal ArticleDOI
A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation
TL;DR: An effective discrete artificial bee colony (DABC) algorithm that has a hybrid representation and a combination of forward decoding and backward decoding methods for solving the HFS problem with the makespan criterion is presented.
Journal ArticleDOI
An estimation of distribution algorithm for lot-streaming flow shop problems with setup times
Quan-Ke Pan,Rubén Ruiz +1 more
TL;DR: A novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation to solve an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases.
References
More filters
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
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.
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.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more