[en] This document presents further numerical results of the experiments concerning the classical instances of the flexible job shop scheduling problem, performed in (Lunardi et al., Metaheuristics for the Online Printing Shop Scheduling Problem, submitted). Additionally, this document gathers the best makespan values (upper bounds and lower bounds) found by state-of-the-art algorithms.
Disciplines :
Computer science
Author, co-author :
Tessaro Lunardi, Willian ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Birgin, Ernesto G.; University of São Paulo > Department of Computer Science, Institute of Mathematics and Statistics
Ronconi, Débora P.; University of São Paulo > Department of Production Engineering, Polytechnic School
Voos, Holger ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Engineering Research Unit ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Engineering Research Unit
Language :
English
Title :
Metaheuristics for the Online Printing Shop Scheduling Problem - Supplementary Material
