Skip to Main content Skip to Navigation
Reports

New effective neighborhoods for the permutation flow shop problem

Abstract : We propose an extension of the Taillard's implementation, which allows to remove efficiently the less well inserted jobs in a permutation. We describe then six new neighborhoods for the permutation flow shop problem. Computational results show clearly that at least three of them are better than the insertion move. Their application into a simple metaheuristic is very effective, since a new upper bound has been found for a hard Taillard's instance.
Document type :
Reports
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00678053
Contributor : Bastien Doreau <>
Submitted on : Monday, March 12, 2012 - 9:38:56 AM
Last modification on : Thursday, June 17, 2021 - 1:50:23 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 12:00:08 PM

File

RR-06-09b.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00678053, version 1

Citation

Laurent Deroussi, Michel Gourgand, Sylvie Norre. New effective neighborhoods for the permutation flow shop problem. 2006. ⟨hal-00678053⟩

Share

Metrics

Record views

324

Files downloads

657