Computationally manageable combinatorial auctions for supply chain automation

  1. Andrea Giovannucci
Supervised by:
  1. Juan A. Rodríguez Aguilar Director
  2. Jesús Cerquides Bueno Director

Defence university: Universitat Autònoma de Barcelona

Fecha de defensa: 31 January 2008

Committee:
  1. Carles Sierra Chair
  2. Vicenç Torras Secretary
  3. Onn Shehory Committee member
  4. R. Jennings Nicholas Committee member
  5. Pedro Meseguer González Committee member

Type: Thesis

Teseo: 145972 DIALNET

Abstract

The need for automating the process of supply chain formation is motivated by the advent of Internet technologies supporting B2B and B2C negotiations: the speed at which market requirements change has dramatically increased. In this scenario enterprises must become flexible in the process of product customisation and order fulfilment. This can be only achieved if the supply chain formation process is agile, and thus the need for automation. The main goal of this dissertation is to provide computationally efficient market-based auction mechanisms for automating the process of optimal supply chain partner selection. This is achieved by means of two progressive, non-trivial extensions of combinatorial auctions (CA). On the one hand, we extend CAs to determine optimal outsourcing strategies. Thus, we provide computational means, via the so-called Multi-unit Combinatorial Auctions with Transformation Relationships (MUCRAtR), for an enterprise to optimise its \emph{make-or-buy} decisions across the supply chain, namely to decide whether to outsource some production processes or not. At this aim, we add a new dimension to the goods at auction. A buyer can express its internal production and cost structure. Firstly, we introduce such information in the winner determination problem (WDP) so that an auctioneer/buyer can assess what goods to buy, from whom, and what internal operations to perform in order to obtain the required resources. In this way, an auctioneer can build his supply chain minimising its costs. Secondly, since the decision problem faced by the auctioneer is extremely hard, we also provide a formal framework to analyse the computational properties of the WDP and to facilitate the classification of WDPs, and hence to provide guidance for developing efficient solution algorithms. On the other hand, we propose a novel CA, the so-called Mixed Multi-unit Combinatorial Auctions (MMUCA), that automates the process of collaborativ