A tabu search for the permutation flow shop problem with sequence dependent setup times
A tabu search for the permutation flow shop problem with sequence dependent setup times
dc.contributor.author | Nicolau Filipe Santos | en |
dc.contributor.author | Rui Diogo Rebelo | en |
dc.contributor.author | João Pedro Pedroso | en |
dc.date.accessioned | 2018-01-18T12:33:12Z | |
dc.date.available | 2018-01-18T12:33:12Z | |
dc.date.issued | 2014 | en |
dc.description.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. | en |
dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/6932 | |
dc.identifier.uri | http://dx.doi.org/10.1504/ijdats.2014.063062 | en |
dc.language | eng | en |
dc.relation | 3160 | en |
dc.relation | 4747 | en |
dc.relation | 5234 | en |
dc.rights | info:eu-repo/semantics/embargoedAccess | en |
dc.title | A tabu search for the permutation flow shop problem with sequence dependent setup times | en |
dc.type | article | en |
dc.type | Publication | en |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- P-009-PG3.pdf
- Size:
- 428.05 KB
- Format:
- Adobe Portable Document Format
- Description: