Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/6932
Title: A tabu search for the permutation flow shop problem with sequence dependent setup times
Authors: Nicolau Filipe Santos
Rui Diogo Rebelo
João Pedro Pedroso
Issue Date: 2014
Abstract: In this work we present a tabu search metaheuristic method for solving the permutation flow shop scheduling problem with sequence dependent setup times and the objective of minimising total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighbourhood, and is characterised by the selection and evaluation of a small subset of this neighbourhood at each iteration; this has consequences both on diversification and intensification of the search. We also propose a speed-up technique based on book keeping information of the current solution, used for the evaluation of its neighbours. © 2014 Inderscience Enterprises Ltd.
URI: http://repositorio.inesctec.pt/handle/123456789/6932
http://dx.doi.org/10.1504/ijdats.2014.063062
metadata.dc.type: article
Publication
Appears in Collections:CEGI - Articles in International Journals
CESE - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-009-PG3.pdf
  Restricted Access
428.05 kBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.