Journal ArticleDOI
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
Reads0
Chats0
TLDR
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.Abstract:
As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.read more
Citations
More filters
Journal ArticleDOI
Iterated Greedy methods for the distributed permutation flowshop scheduling problem
TL;DR: This paper studies an extension of the well known permutation flowshop scheduling problem in which there is a set of identical factories, each one with a flowshop structure, and presents simple Iterated Greedy algorithms that have performed well in related problems.
Journal ArticleDOI
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
TL;DR: A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out and the results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.
Journal ArticleDOI
A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
TL;DR: A competitive memetic algorithm (CMA) is proposed to solve the multi-objective distributed permutation flow-shop scheduling problem (MODPFSP) with the makespan and total tardiness criteria.
Journal ArticleDOI
An Ensemble Discrete Differential Evolution for the Distributed Blocking Flowshop Scheduling with Minimizing Makespan Criterion
TL;DR: An ensemble discrete differential evolution (EDE) algorithm is proposed to solve the blocking flowshop scheduling problem with the minimization of the makespan in the distributed manufacturing environment.
Journal ArticleDOI
A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop
Jing-jing Wang,Ling Wang +1 more
TL;DR: This paper addresses an energy-efficient scheduling of the distributed permutation flow-shop (EEDPFSP) with the criteria of minimizing both makespan and total energy consumption.
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
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
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 scatter search algorithm for the distributed permutation flowshop scheduling problem
Bahman Naderi,Rubén Ruiz +1 more
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Jian Gao,Rong Chen,Wu Deng +2 more