A travelling salesman approach to solve the F =no-idle=Cmax problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2005

A travelling salesman approach to solve the F =no-idle=Cmax problem

Résumé

This paper investigates the F =no-idle=Cmax problem, where machines work continuously without idle time intervals. The idle characteristic is a very strong constraint and it affects seriously the value of Cmax criterion. We treat here only the permutation flow-shop configuration for machine no-idle problems with the objective to minimise the makespan. Based on the idea that this problem can be modelled as a travelling salesman problem, an adaptation of the well-known nearest insertion rule is proposed to solve it. A computational study shows the result quality.
Fichier non déposé

Dates et versions

hal-00377579 , version 1 (22-04-2009)

Identifiants

  • HAL Id : hal-00377579 , version 1

Citer

Nour-El-Houda Saadani, Alain Guinet. A travelling salesman approach to solve the F =no-idle=Cmax problem. European Journal of Operational Research, 2005, 161, pp.11-20. ⟨hal-00377579⟩
51 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More