Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times

The multiobjective permutation flow shop scheduling problem with sequence dependent setup times has been an object of investigations for decades. This widely studied problem from the scheduling theory links the sophisticated solution algorithms with the moderate real world applications. This paper p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on engineering management Jg. 64; H. 2; S. 149 - 165
Hauptverfasser:	Li, Xiangtao, Ma, Shijing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">MODABC/D Algorithms Decomposition Evolutionary computation flow shop Job shop scheduling Job shops local search multiobjective optimization Multiple objective analysis Optimization Optimization algorithms Permutations Processor scheduling Production scheduling Scheduling Search algorithms Sequential scheduling Setup times Sociology Statistics Swarm intelligence
ISSN:	0018-9391, 1558-0040
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!