China Mechanical Engineering ›› 2026, Vol. 37 ›› Issue (7): 1755-1762.DOI: 10.3969/j.issn.1004-132X.2026.07.025

Previous Articles     Next Articles

Optimization of Platform Order Acceptance and Scheduling Considering the Portfolio of Manufacturing Service Resource Bidding Options

CHEN Wenchong1,2(), LYU Xueting2, QI Jiehui3, LIU Hongwei4,1(), QI Ershi4   

  1. 1.Experimental Center of Data Science and Intelligent Decision-making,Hangzhou Dianzi University,Hangzhou,310018
    2.College of Management,Hangzhou Dianzi University,Hangzhou,310018
    3.The Technology Committee of H3C Technologies Co. ,Lid. ,Hangzhou,310051
    4.College of Management and Economics,Tianjin University,Tianjin,300192
  • Received:2025-08-12 Online:2026-07-25 Published:2026-08-18
  • Contact: LIU Hongwei

考虑制造资源竞拍方案组合的平台订单接收与调度优化

陈文冲1,2(), 吕雪婷2, 戚杰辉3, 刘洪伟4,1(), 齐二石4   

  1. 1.杭州电子科技大学数据科学与智能决策实验中心, 杭州, 310018
    2.杭州电子科技大学管理学院, 杭州, 310018
    3.新华三技术有限公司技术委员会, 杭州, 310051
    4.天津大学经济与管理学部, 天津, 300192
  • 通讯作者: 刘洪伟
  • 作者简介:陈文冲,男,1990年生,副教授。研究方向为工业互联网平台运营、制造服务供需匹配。发表论文20余篇。E-mail:wcchen@hdu.edu.cn
    刘洪伟(通信作者),男,1971年生,教授。研究方向为智能制造、工业工程与管理。E-mail: 1016209007@tju.edu。cn。
  • 基金资助:
    浙江省哲学社会科学规划课题(23NDJC156YB);国家自然科学基金(72201082)

Abstract:

This paper addresses the order acceptance and scheduling problem under a combinatorial auction mechanism on a manufacturing platform. Taking the set of subtask bidding schemes submitted by manufacturing resources as input, and considering both the process correlation constraints among subtasks and the scheduling constraints within each resource, a mixed-integer linear programming model is formulated to maximize platform revenue and user satisfaction. An adaptive large neighborhood search algorithm is developed, featuring a three-layer chromosome encoding structure, a neighborhood correlation removal operator, a repair operator based on the Cartesian product search strategy, and a repair strategy for resource scheduling feasibility. The effectiveness of the proposed model and algorithm is validated through artificial instances and a real-world case of automotive fuel tank manufacturing. The results show that, compared with two rule-based methods currently used by the platform, the proposed method increases platform revenue by 9.83% and 61.06%, and improves user satisfaction by 29.23% and 61.54%, respectively.

Key words: manufacturing resources, combinatorial auctions, manufacturing platform, order acceptance and scheduling, adaptive large neighborhood search

摘要:

针对制造平台竞拍机制下的订单接收与调度问题,提出一种考虑制造资源竞拍方案组合的优化方法。以制造资源提交的子任务竞拍方案集为输入,以子任务间的工艺关联关系、同一制造资源的任务调度等为约束,构建了考虑平台收益和行业用户满意度的订单接收与调度混合整数线性规划模型。提出了自适应大规模邻域搜索算法,设计了三层染色体编码结构、邻域关联移除算子、基于笛卡儿积搜索策略的修复算子以及制造资源调度方案的可行解修复策略。人工算例和汽车燃油箱制造案例验证了模型与算法的有效性。相比于平台当前采用的两种规则型方法,所提方法使平台收益分别提高9.83%和61.06%,用户满意度分别提高29.23%和61.54%。

关键词: 制造资源, 竞拍方案组合, 制造平台, 订单接收与调度, 自适应大规模邻域搜索

CLC Number: