主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2026, Vol. 34 ›› Issue (9): 173-183.doi: 10.16381/j.cnki.issn1003-207x.2024.1431

• • 上一篇    下一篇

基于产品—机器指派的动态调度和预防性维护方法

杨洋1(), 张斌2, 吴政鸿2   

  1. 1.江西财经大学信息管理与数学学院,江西 南昌 330032
    2.台湾大学工业工程学研究所,台湾 台北 10617
  • 收稿日期:2024-08-21 修回日期:2025-09-16 出版日期:2026-09-25 发布日期:2026-09-01
  • 通讯作者: 杨洋 E-mail:y.yang@jxufe.edu.cn
  • 基金资助:
    国家自然科学基金项目(U2268209);江西省教育厅科技项目(GJJ2200525)

A Dynamic Scheduling and Preventive Maintenance Method Based on Product-machine Assignment

Yang Yang1(), Bin Zhang2, Chenghung Wu2   

  1. 1.School of Information Management and mathematics,Jiangxi University of Finance and Economics,Nanchang 330032,China
    2.Graduate Institute of Industrial Engineering,Taiwan University,Taipei 10617,China
  • Received:2024-08-21 Revised:2025-09-16 Online:2026-09-25 Published:2026-09-01
  • Contact: Yang Yang E-mail:y.yang@jxufe.edu.cn

摘要:

本文面向多产品、多机器的柔性制造系统,研究动态调度与预防性维护决策联合优化。考虑产品到达、加工等过程的随机性以及设备状态的劣化与维护恢复,提出产品-机器指派框架。先以混合整数线性规划按机器维度将原问题结构化分解为若干单机子问题,并通过匹配产品需求与机器特性在产出最大化与机器专用性之间实现权衡。继而建立并求解单机连续时间马尔可夫决策过程,合成得到原系统的近似最优策略。该方法使总体计算复杂度随机器数近似线性增长,具备大规模场景的可扩展性。数值仿真结果表明,产品-机器指派框架在提升加工量与缩短周期时间方面较传统调度方法具有显著优势。

关键词: 产品-机器指派, 动态调度, 预防性维护, 马尔科夫决策过程

Abstract:

A joint production dispatching and preventive maintenance problem in multi-product, heterogeneous-machine manufacturing is addressed through a Product-Machine Assignment (PMA) framework. The assignment is formulated as a mixed-integer linear program that matches product types to machines and controls per-machine variety through a penalty parameter κ, achieving a balance between throughput and machine specialization. The assignment decomposes the system into independent multi-product single-machine subproblems, each solved as a continuous-time Markov decision process to coordinate dispatching and preventive maintenance. Combining these yields a near-optimal system policy with computational complexity growing approximately linearly in the number of machines. Numerical experiments on 30 instances, compared with Cμ, First-Come-First-Served, and Round-Robin under throughput and cycle-time metrics, show that PMA maintains throughput while notably reducing cycle time. Additional tests under non-Markovian inter-event times and a real semiconductor workstation dataset exhibit consistent performance. The results indicate that PMA provides a scalable and interpretable approach for real-time joint dispatching and maintenance decisions in large heterogeneous manufacturing systems.

Key words: product-machine assignments, dynamic scheduling, preventive maintenance, Markov decision process

中图分类号: