By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Giovannucci, A. ; Artificial Intell. Res. Inst. CSIC, Spanish Nat. Res. Council, Bellaterra, Spain ; Cerquides, J. ; Rodriguez-Aguilar, J.A.

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.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:40 ,  Issue: 4 )