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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on engineering management Ročník 64; číslo 2; s. 149 - 165
Hlavní autoři:	Li, Xiangtao, Ma, Shijing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	<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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!