TY - GEN
T1 - Dynamic Double-sided Rolling-Horizon Auction Mechanisms for Additive Manufacturing Collaboration in Social Manufacturing
AU - Sun, Mingyue
AU - Li, Jinpeng
AU - Chen, Qiqi
AU - Zhang, Mengdi
AU - Zhao, Zhiheng
AU - Huang, George Q.
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025/8
Y1 - 2025/8
N2 - The fusion of Social Manufacturing (SM) and Additive Manufacturing (AM) has led to the emergence of distributed and cooperative production models, where prosumers seamlessly transition between the roles of producers and consumers. However, existing manufacturing-sharing platforms often struggle to accommodate the bidirectional, dynamic, and long-term collaborative requirements inherent to AM. We first design an one-shot double-sided VCG auction mechanism, ensuring incentive compatibility, allocative efficiency and individual rationality. To support long-term and adaptive AM collaboration, this study design two rolling-horizon auction mechanisms: (1) a greedy algorithm-driven approach, which iteratively assigns AM orders by utilizing short-term price variations, and (2) a heuristic-based auction, which reformulates the collaborative manufacturing problem as a Maximum Weighted Independent Set (MWIS) problem, solved using a hybrid Iterated Local Search (ILS) heuristic. To assess the effectiveness of these mechanisms, we conduct a numerical experiment, demonstrating their capability to enhance AM resource efficiency and foster collaborative production.
AB - The fusion of Social Manufacturing (SM) and Additive Manufacturing (AM) has led to the emergence of distributed and cooperative production models, where prosumers seamlessly transition between the roles of producers and consumers. However, existing manufacturing-sharing platforms often struggle to accommodate the bidirectional, dynamic, and long-term collaborative requirements inherent to AM. We first design an one-shot double-sided VCG auction mechanism, ensuring incentive compatibility, allocative efficiency and individual rationality. To support long-term and adaptive AM collaboration, this study design two rolling-horizon auction mechanisms: (1) a greedy algorithm-driven approach, which iteratively assigns AM orders by utilizing short-term price variations, and (2) a heuristic-based auction, which reformulates the collaborative manufacturing problem as a Maximum Weighted Independent Set (MWIS) problem, solved using a hybrid Iterated Local Search (ILS) heuristic. To assess the effectiveness of these mechanisms, we conduct a numerical experiment, demonstrating their capability to enhance AM resource efficiency and foster collaborative production.
UR - https://www.scopus.com/pages/publications/105018334552
U2 - 10.1109/CASE58245.2025.11163772
DO - 10.1109/CASE58245.2025.11163772
M3 - Conference article published in proceeding or book
AN - SCOPUS:105018334552
T3 - IEEE International Conference on Automation Science and Engineering
SP - 631
EP - 636
BT - 2025 IEEE 21st International Conference on Automation Science and Engineering, CASE 2025
PB - IEEE Computer Society
T2 - 21st IEEE International Conference on Automation Science and Engineering, CASE 2025
Y2 - 17 August 2025 through 21 August 2025
ER -