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
