New effective neighborhoods for the permutation flow shop problem
type: Dataset
description: 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.
issued: 2026-05-25T03:56:46.199376
language: en
modified: 2026-05-25T03:56:46.199384
contact point: Organization
  fn: CCSD
keyword: flow-shop-problem
keyword: infoeu-reposemanticsreport
keyword: infoinfo-rocomputer-science-csoperations-research-mathoc
keyword: metaheuristic
keyword: neighborhood
keyword: reports
landing page: https://hal.science/hal-00678053

New effective neighborhoods for the permutation flow shop problem
type: Distribution
format: HTML
issued: 2026-05-25T03:56:46.289030
modified: 2026-05-25T03:56:46.175834
access URL: https://hal.science/hal-00678053

test_moissonnage_selune
type: Agent