Modern production systems require multiple manufacturing centers—usually distributed among different locations—where the outcomes of each center need to be assembled to generate the final product. This paper discusses the distributed assembly permutation flow-shop scheduling problem, which consists of two stages: the first stage is composed of several production factories, each of them with a flow-shop configuration; in the second stage, the outcomes of each flow-shop are assembled into a final product. The goal here is to minimize the makespan of the entire manufacturing process. With this objective in mind, we present an efficient and parameter-less algorithm that makes use of a biased-randomized iterated local search metaheuristic. The efficiency of the proposed method is evaluated through the analysis of an extensive set of computational experiments. The results show that our algorithm offers excellent performance when compared with other state-of-the-art approaches, obtaining several new best solutions.

Ferone, D., Hatami, S., González‐neira, E., Juan, A., Festa, P. (2020). A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 27(3), 1368-1391 [10.1111/itor.12719].

A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem

Ferone, D
;
2020

Abstract

Modern production systems require multiple manufacturing centers—usually distributed among different locations—where the outcomes of each center need to be assembled to generate the final product. This paper discusses the distributed assembly permutation flow-shop scheduling problem, which consists of two stages: the first stage is composed of several production factories, each of them with a flow-shop configuration; in the second stage, the outcomes of each flow-shop are assembled into a final product. The goal here is to minimize the makespan of the entire manufacturing process. With this objective in mind, we present an efficient and parameter-less algorithm that makes use of a biased-randomized iterated local search metaheuristic. The efficiency of the proposed method is evaluated through the analysis of an extensive set of computational experiments. The results show that our algorithm offers excellent performance when compared with other state-of-the-art approaches, obtaining several new best solutions.
Articolo in rivista - Articolo scientifico
assembly system; biased randomization; distributed manufacturing system; iterated local search; metaheuristic; permutation flow-shop scheduling;
English
6-set-2019
2020
27
3
1368
1391
none
Ferone, D., Hatami, S., González‐neira, E., Juan, A., Festa, P. (2020). A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 27(3), 1368-1391 [10.1111/itor.12719].
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/241806
Citazioni
  • Scopus 53
  • ???jsp.display-item.citation.isi??? 47
Social impact