English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160170
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Composing Supply Chains Through Multiunit Combinatorial Reverse Auctions With Transformability Relationships Among Goods

AuthorsGiovannucci, Andrea; Cerquides, Jesús ; Rodríguez-Aguilar, Juan Antonio
KeywordsPetri nets (PNs
Winner-determination problem
Combinatorial auctions (CAs)
Supply-chain management
Issue Date2010
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans, 40: 767- 778 (2010)
AbstractIn this paper, we introduce a novel auction-based decision support system to help a firm readily assemble supply chains. At this aim, we tackle the problem of deciding whether to outsource some production processes or not-the so-called make-or-buy decision problem. The solution to the make-or-buy decision problem is an optimal supply chain whose operations are either performed in-house or outsourced. We propose to employ a novel extension of combinatorial reverse auctions, the so-called Multiunit Combinatorial Reverse Auction with Transformability Relationships Among Goods, which allows the following: 1) a buyer/auctioneer to express transformability relationships among goods (some goods can be transformed into others at some transformation cost) and 2) bidders to express their preferences over bundles of goods.
Identifiersdoi: 10.1109/TSMCA.2009.2037236
issn: 1083-4427
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.