Release date optimisation in MRP using clearing functions
本文提出一种基于清除函数的订单释放优化模型，替代MRP中的倒排排程步骤，通过仿真实验证明其能显著改善传统方法，尤其能为单个生产订单计算计划提前期。
This paper integrates a clearing function (CF)-based release planning approach into Material Requirements Planning (MRP) to address its limitations in modelling capacity constraints and dynamic lead times. The proposed optimisation model replaces MRP’s backward scheduling step while preserving its overall structure. Performance is evaluated through simulation experiments on two flow shop systems that explore a range of demand uncertainties and utilisation levels. Computational results show that the proposed approach is capable of yielding significant improvements over the conventional backward scheduling approach, due to its ability to compute planned lead times for individual production orders as opposed to BOM items.