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

Full description

Bibliographic Details

Published in:	Swarm and evolutionary computation Vol. 53; p. 100632
Main Authors:	Soto, Carlos, Dorronsoro, Bernabé, Fraire, Héctor, Cruz-Reyes, Laura, Gomez-Santillan, Claudia, Rangel, Nelson
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!