A series of algorithms relevant to one of the commonly used layout schemes in flexible manufacturing systems, that is, the single-row layout, is presented. The algorithms constitute a modified version of a known technique developed for the n/m/F/Fmax sequencing problem. As a result, heuristics are obtained which are easy to implement and which generate good solutions in acceptable response times and outperform other algorithms developed to the same end. An iterative method based on a neighbourhood search is also developed to evaluate the performances in absolute terms.
Heuristics for single row layout problems in flexible manufacturing systems
BRAGLIA, MARCELLO
1997-01-01
Abstract
A series of algorithms relevant to one of the commonly used layout schemes in flexible manufacturing systems, that is, the single-row layout, is presented. The algorithms constitute a modified version of a known technique developed for the n/m/F/Fmax sequencing problem. As a result, heuristics are obtained which are easy to implement and which generate good solutions in acceptable response times and outperform other algorithms developed to the same end. An iterative method based on a neighbourhood search is also developed to evaluate the performances in absolute terms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
