Worldwide competition originated the development of integrated supply chains (SCs) that are distributed manufacturing systems integrating international logistics and information technologies with production. This paper develops a decision-making model based on discrete consensus in order to assign tasks to each actor of the SC at the operational level. In particular, some actors of the SC generate tasks that other actors, localized in a downstream stage, have to complete. We provide a novel distributed algorithm that aims to minimize the task costs assuming that each actor can perform a subset of the available tasks and can communicate with a subset of actors. In order to show the effectiveness of the distributed algorithm, a case study is considered. The problem is formalized as a distributed consensus algorithm, i.e., as a procedure using which the agents of the SC can exchange messages and update autonomously and iteratively their assigned tasks. Some results prove that the convergence to a task assignment consensus is reached in finite time and a stopping criterion is provided.

A Distributed Consensus Algorithm for Task Allocation in Supply Chain Management

FANTI, MARIA PIA;MANGINI, AGOSTINO MARCELLO;UKOVICH, WALTER
2012-01-01

Abstract

Worldwide competition originated the development of integrated supply chains (SCs) that are distributed manufacturing systems integrating international logistics and information technologies with production. This paper develops a decision-making model based on discrete consensus in order to assign tasks to each actor of the SC at the operational level. In particular, some actors of the SC generate tasks that other actors, localized in a downstream stage, have to complete. We provide a novel distributed algorithm that aims to minimize the task costs assuming that each actor can perform a subset of the available tasks and can communicate with a subset of actors. In order to show the effectiveness of the distributed algorithm, a case study is considered. The problem is formalized as a distributed consensus algorithm, i.e., as a procedure using which the agents of the SC can exchange messages and update autonomously and iteratively their assigned tasks. Some results prove that the convergence to a task assignment consensus is reached in finite time and a stopping criterion is provided.
2012
9783902661982
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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/11368/2558008
 Avviso

Registrazione in corso di verifica.
La registrazione di questo prodotto non è ancora stata validata in ArTS.

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact