Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm

This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop scheduling problem for the first time, to the very best of our knowledge. It makes use of the well-known NSGA-II algorithm to initialize its u...

Celý popis

Podrobná bibliografia

Vydané v:	Swarm and evolutionary computation Ročník 53; s. 100632
Hlavní autori:	Soto, Carlos, Dorronsoro, Bernabé, Fraire, Héctor, Cruz-Reyes, Laura, Gomez-Santillan, Claudia, Rangel, Nelson
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.03.2020
Predmet:	Branch and bound Flexible job shop problem Multiple objective programming Scheduling Shared memory programming Flexible job shop problem Scheduling Shared memory programming Branch and bound Multiple objective programming
ISSN:	2210-6502
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!