- -

New hard benchmark for flowshop scheduling problems minimising makespan

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

New hard benchmark for flowshop scheduling problems minimising makespan

Show simple item record

Files in this item

dc.contributor.author Vallada Regalado, Eva es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.contributor.author Framinan, Jose M. es_ES
dc.date.accessioned 2016-04-28T16:45:05Z
dc.date.available 2016-04-28T16:45:05Z
dc.date.issued 2015-02-01
dc.identifier.issn 0377-2217
dc.identifier.uri http://hdl.handle.net/10251/63119
dc.description.abstract [EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the work is to generate a benchmark which satisfies the desired characteristics of any benchmark: comprehensive, amenable for statistical analysis and discriminant when several algorithms are compared. An exhaustive experimental procedure is carried out in order to select the hard instances, generating thousands of instances and selecting the hardest ones from the point of view of a gap computed as the difference between very good upper and lower bounds for each instance. Extensive generation and computational experiments, which have taken almost six years of combined CPU time, demonstrate that the proposed benchmark is harder and with more discriminant power than the most common benchmark from the literature. Moreover, a website is developed for researchers in order to share sets of instances, best known solutions and lower bounds, etc. for any combinatorial optimisation problem. es_ES
dc.description.sponsorship Eva Vallada and Ruben Ruiz are partially supported by the Spanish Ministry of Science and Innovation, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" with reference DPI2012-36243-C02-01 co-financed by the European Union and FEDER funds and by the Universitat Politecnica de Valencia, for the project MRPIV with reference PAID/2012/202. The authors would like to acknowledge the help received from Juan Cabota in the early development of the web of instances.
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation MICINN/DPI2012-36243-C02-01 es_ES
dc.relation UPV/PAID/2012/202 es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Flowshop es_ES
dc.subject Makespan es_ES
dc.subject Benchmark es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title New hard benchmark for flowshop scheduling problems minimising makespan es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2014.07.033
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Vallada Regalado, E.; Ruiz García, R.; Framinan, JM. (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research. 240(3):666-677. doi:10.1016/j.ejor.2014.07.033 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.ejor.2014.07.033 es_ES
dc.description.upvformatpinicio 666 es_ES
dc.description.upvformatpfin 677 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 240 es_ES
dc.description.issue 3 es_ES
dc.relation.senia 306680 es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación
dc.contributor.funder Universitat Politècnica de València


This item appears in the following Collection(s)

Show simple item record