In this paper we present a beam-search-based constructive heuristic to solve the
permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed
in the literature. The proposed algorithm is inspired in the logic of the beam search,
although it remains a fast constructive heuristic.
The results obtained by the proposed algorithm outperform those obtained by
other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In
addition, the proposed algorithm even outperforms two of the best metaheuristics for
many instances of the problem, using much lesser computation effort. The excellent
performance of the proposal is also proved by the fact that the new heuristic found
new best upper bounds for 35 of the 120 instances in Taillard’s benchmark.Ministerio de Ciencia e Innovación DPI2013-44461-PMinisterio de Ciencia e Innovación DPI2016-80750-
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.