Computationally Manageable Combinatorial Auctions for Supply Chain Automation
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...
| Autor principal: | |
|---|---|
| Formato: | Tesis |
| Idioma: | Inglés |
| Publicado: |
Bellaterra :
Consejo Superior de Investigaciones Científicas
2008.
|
| Colección: | Monografies de l'Institut d'Investigació en Intel-ligencia Artificial.
|
| Materias: | |
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b33063813*spi |
| Sumario: | 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 marketbased 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). |
|---|---|
| Descripción Física: | XXIV, 231 p. : gráf |
| Formato: | Forma de acceso: World Wide Web. |
| ISBN: | 9788400086664 |
