Optimal Foraging Algorithm That Incorporates Fuzzy Relative Entropy for Solving Many-Objective Permutation Flow Shop Scheduling Problems

Permutation flow shop scheduling problems (PFSPs) with many objectives are highly important scheduling problems in operations research. They have attracted substantial attention from enterprise operators and researchers in recent years. In this article, a membership function is used to connect the f...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on fuzzy systems 2020-11, Vol.28 (11), p.2738-2746
Hauptverfasser:	Zhu, Guang-Yu, Ding, Chen, Zhang, Wei-Bo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Classification algorithms Energy consumption Entropy Fuzzy entropy fuzzy relative entropy (FRE) Fuzzy sets Job shop scheduling Job shops Machine tools many-objective permutation flow shop scheduling problems (PFSPs) Multiple objective analysis Operations research optimal foraging algorithm (OFA) Optimization Permutations Scheduling
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!