A discrete butterfly-inspired optimization algorithm for solving Permutation Flow-Shop scheduling Problems
نویسندگان
چکیده
منابع مشابه
A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملNNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems
The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations incl...
متن کاملSolving No-Wait Flow Shop Scheduling Problems by a Hybrid Quantum-Inspired Evolutionary Algorithm
This paper is the first to consider the hybrid quantum-inspired evolutionary algorithm (HQEA) on the no-wait permutation flow shop scheduling problem (PFSP) for minimizing the makespan. In this HQEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple but efficient converting mechanism for determining job sequence is proposed for the representation of solution f...
متن کاملSolving hybrid flow shop scheduling problems using bat algorithm
This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Network World
سال: 2020
ISSN: 2336-4335
DOI: 10.14311/nnw.2020.30.015