Clearing function-based release date optimization in a multi-item multi-stage MRP planned production system in a rolling-horizon planning environment with multilevel BOM
This study explores the integration of clearing function (CF)-based release planning into Material Requirements Planning (MRP) systems, with a focus on mitigating the inherent rigidity of MRP in handling variability in production environments. By replacing the backward scheduling step of MRP with a CF-based optimization model, this work investigates its impact on overall costs, lead times, and system performance in multi-item, multi-stage production systems. Computational experiments were conducted on two distinct systems - a simple and a complex production system - under varying demand behaviors and utilization levels. The findings reveal that the CF-based release order planning consistently outperforms traditional MRP in managing cost and variability, particularly under scenarios of higher demand uncertainty and shop load. While MRP demonstrates stability in less complex scenarios, its inability to adapt dynamically to variability leads to higher costs in most conditions. The analysis underscores the potential of CF-based methods to enhance planning efficiency in dynamic production settings, providing a foundation for future research on integrating capacity constraints within the broader MRP framework.
Code (0)
등록된 구현이 없습니다.
Tasks
SchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Decision-Focused Predict-then-Bid Framework for Strategic Energy Storage
This paper introduces a novel decision-focused framework for energy storage arbitrage bidding. Inspired by the bidding process for energy storage in electricity markets, we propose a predict-then-bid end-to-end method in…
Learning to Clear the Market
The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied. In this work, we cast the problem of predicting clearing prices into a learning framework and use the res…
RAILS: Verification-Native Clearing For Agentic Commerce
Autonomous agents negotiate, purchase, deploy code, and move funds, but no neutral mechanism determines whether they met their delegated obligation, who is responsible when they did not, or which settlement action follow…
Multi-Interval Energy-Reserve Co-Optimization with SoC-Dependent Bids from Battery Storage
We consider the problem of co-optimized energy-reserve market clearing with state-of-charge (SoC) dependent bids from battery storage participants. While SoC-dependent bids capture storage's degradation and opportunity c…
Machine Learning for Electricity Market Clearing
This paper seeks to design a machine learning twin of the optimal power flow (OPF) optimization, which is used in market-clearing procedures by wholesale electricity markets. The motivation for the proposed approach stem…
BIG-bench Machine Learning