Article thumbnail

Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness

By Víctor Fernández-Viagas Escudero, Manuel Dios and José Manuel Framiñán Torres

Abstract

In this paper we address the problem of scheduling jobs in a permutation flowshop with a just-in-time objective, i.e. the minimisation of the sum of total tardiness and total earliness. Since the problem is NP-hard, there are several approximate procedures available for the problem, although their performance largely depends on the due dates of the specific instance to be solved. After an in-depth analysis of the problem, different cases or sub-problems are identified and, by incorporating this knowledge, four heuristics are proposed: a fast constructive heuristic, and three different local search procedures that use the proposed constructive heuristic as initial solution. The proposed Prod. Type: FLPheuristics have been compared on an extensive set of instances with the best-so-far heuristic for the problem, as well as with adaptations of efficient heuristics for similar scheduling problems. The computational results show the excellent performance of the proposed algorithms. Finally, the positive impact of the efficient heuristics is evaluated by including them as seed sequences for one of the best metaheuristic for the problem

Topics: Scheduling, Flowshop, Heuristics
Publisher: 'Elsevier BV'
Year: 2016
OAI identifier: oai:idus.us.es:11441/95255
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://idus.us.es/handle//114... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.