Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 240, Issue 3, Pages 666-677Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2014.07.033
Keywords
Flowshop; Makespan; Benchmark
Funding
- Spanish Ministry of Science and Innovation [DPI2012-36243-C02-01]
- European Union
- FEDER
- Universitat Politecnica de Valencia [PAID/2012/202]
Ask authors/readers for more resources
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. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available