Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem
The multiobjective permutation flowshop scheduling problem (MOPFSSP) is one of the most popular machine scheduling problems with extensive engineering relevance of manufacturing systems. There have been many attempts at solving MOPFSSP using heuristic and meta-heuristic methods, such as evolutionary...
Main Authors: | Xiangtao Li, Shijing Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2016-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7467399/ |
Similar Items
-
On the distribution of Pareto optimal solutions in alternative space – the investigation of multi objective permutation flow shop scheduling problems
by: Martin Josef Geiger
Published: (2006-03-01) -
A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING
by: Cristina Elena DODU, et al.
Published: (2020-06-01) -
An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem
by: Mehrdad Amirghasemi
Published: (2021-03-01) -
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
by: Gao, Kai Zhou, et al.
Published: (2016) -
Multi-Agent Model based on Tabu Search for the Permutation Flow Shop Scheduling Problem
by: Hafewa BARGAOUI, et al.
Published: (2014-10-01)