Composing supply chains through multiunit combinatorial reverse auctions with transformability relationships among goods

7Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 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. © 2010 IEEE.

Cite

CITATION STYLE

APA

Giovannucci, A., Cerquides, J., & Rodríguez-Aguilar, J. A. (2010). Composing supply chains through multiunit combinatorial reverse auctions with transformability relationships among goods. IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans, 40(4), 767–778. https://doi.org/10.1109/TSMCA.2009.2037236

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free