arXiv:2512.01093cs.LGcs.SY2025-12

在信息不全时,用贝叶斯方法动态调度生产流程,降低成本和计划震荡。

Bayesian dynamic scheduling of multipurpose batch processes under incomplete look-ahead information

  • 基于贝叶斯网络建模干扰对工序的影响概率
  • 相比定期重排,长期成本更低且计划更稳定
  • 适用于干扰独立的各类调度场景,可灵活扩展

多用途间歇式生产过程因适应小批量、高价值产品和需求波动而日益普及。此类过程常处于动态环境,面临加工延迟和需求变化等扰动。为降低长期成本与系统神经质(即计划频繁剧烈变动),调度者需设计有效应对扰动的重调度策略。现有方法通常假设可获得整个计划周期的完整前瞻信息,但现实中调度者仅能获取不完全信息。依赖现有方法可能导致长期成本偏高且系统神经质水平上升。本文提出一种贝叶斯动态调度方法,通过学习扰动概率分布构建贝叶斯网络,刻画各工序受扰动影响的可能性。在线执行中,当新扰动出现时,方法更新后验分布,指导重调度决策。在四个基准问题上,与周期性重排策略(固定间隔从头生成新计划)对比,结果表明本方法在长期成本和系统神经质方面均显著更优。理论上,若扰动相互独立,则影响量化变量自然满足贝叶斯网络所需的独立性假设。因此,只要定义好工序间的特定依赖关系,该方法可推广至其他调度问题(如作业车间调度和连续过程)。

原文摘要 · Abstract (English)

Multipurpose batch processes become increasingly popular in manufacturing industries since they adapt to low-volume, high-value products and shifting demands. These processes often operate in a dynamic environment, which faces disturbances such as processing delays and demand changes. To minimise long-term cost and system nervousness (i.e., disruptive changes to schedules), schedulers must design rescheduling strategies to address such disturbances effectively. Existing methods often assume complete look-ahead information over the scheduling horizon. This assumption contrasts with realistic situations where schedulers can only access incomplete look-ahead information. Sticking with existing methods may lead to suboptimal long-term costs and high-level system nervousness. In this work we propose a Bayesian dynamic scheduling method. Our method relies on learning a Bayesian Network from the probability distribution of disturbances. Specifically, the Bayesian Network represents how likely each operation will be impacted by disturbances. During the online execution, when new disturbances become observed, this method updates the posterior distribution and therefore guides the rescheduling strategy. We compare our method with the existing periodic rescheduling strategy (which generates new schedules from scratch at fixed intervals) on four benchmark problems. Computational results show that our method achieves statistically better long-term costs and system nervousness. In the theoretical aspect, we prove that if disturbances are mutually independent, the impact-quantifying variables inherently satisfy the independence assumptions required by Bayesian Networks. As an implication, practitioners can extend the method to other scheduling problems (such as job shop scheduling and continuous processes), given that they define the problem-specific dependencies between operations.

动态调度贝叶斯网络生产优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。