Reference : Metaheuristics for the Online Printing Shop Scheduling Problem - Supplementary Material
Reports : Expert report
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/43275
Metaheuristics for the Online Printing Shop Scheduling Problem - Supplementary Material
English
Tessaro Lunardi, Willian mailto [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 mailto [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]
2020
[en] job shop ; flexible job shop ; metaheuristics ; scheduling ; genetic algorithm ; differential evolution ; tabu search ; iterated local search
[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.
http://hdl.handle.net/10993/43275

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
metaheuristics_ops_sup_material.pdfAuthor preprint170.79 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.