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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Swarm and evolutionary computation Jg. 53; S. 100632
Hauptverfasser:	Soto, Carlos, Dorronsoro, Bernabé, Fraire, Héctor, Cruz-Reyes, Laura, Gomez-Santillan, Claudia, Rangel, Nelson
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.03.2020
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!