TY - JOUR
T1 - Platform-Aggregated Manufacturing Service Collaboration
T2 - A Collaborative Optimization Approach for Delay-Constrained Applications
AU - Gao, Yanshan
AU - Cheng, Ying
AU - Tao, Fei
AU - Wang, Lei
N1 - Publisher Copyright:
© IEEE. 2005-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - To tackle challenges of low profitability and high response delays in multitask competitive production environments with fluctuating capacity, this article studies a collaborative optimization approach of task admission and service scheduling with dynamic pricing aid. First, in the context of platform-aggregated manufacturing service collaboration, we introduce service queues to account for response delays and develop a novel nonlinear profit optimization model. This model optimizes task admission, service scheduling, and pricing decisions simultaneously, to adapt the admitted task load to the fluctuating capacity and enhance the throughput utilities of heterogeneous services. To solve this large-scale, nonlinear optimization problem, we then propose a novel distributed online task admission and service scheduling optimization strategy by constructing a Lyapunov quadratic function. It coordinates the optimal decisions for each service in a computationally efficient manner without requiring prior knowledge of task statistics or data training. Moreover, we analytically illustrate that our approach can achieve the optimal time average profit while bounding time average queue length over temporal fluctuations. Numerical results from real workload traces demonstrate the effectiveness of our approach compared to three existing strategies, offering valuable insights for platform operations.
AB - To tackle challenges of low profitability and high response delays in multitask competitive production environments with fluctuating capacity, this article studies a collaborative optimization approach of task admission and service scheduling with dynamic pricing aid. First, in the context of platform-aggregated manufacturing service collaboration, we introduce service queues to account for response delays and develop a novel nonlinear profit optimization model. This model optimizes task admission, service scheduling, and pricing decisions simultaneously, to adapt the admitted task load to the fluctuating capacity and enhance the throughput utilities of heterogeneous services. To solve this large-scale, nonlinear optimization problem, we then propose a novel distributed online task admission and service scheduling optimization strategy by constructing a Lyapunov quadratic function. It coordinates the optimal decisions for each service in a computationally efficient manner without requiring prior knowledge of task statistics or data training. Moreover, we analytically illustrate that our approach can achieve the optimal time average profit while bounding time average queue length over temporal fluctuations. Numerical results from real workload traces demonstrate the effectiveness of our approach compared to three existing strategies, offering valuable insights for platform operations.
KW - Delay-constrained applications
KW - Lyapunov quadratic function
KW - platform-aggregated manufacturing service collaboration (MSC)
KW - pricing
KW - service scheduling
UR - https://www.scopus.com/pages/publications/105005553432
U2 - 10.1109/TII.2025.3563555
DO - 10.1109/TII.2025.3563555
M3 - 文章
AN - SCOPUS:105005553432
SN - 1551-3203
VL - 21
SP - 6375
EP - 6386
JO - IEEE Transactions on Industrial Informatics
JF - IEEE Transactions on Industrial Informatics
IS - 8
ER -