Papers
Topics
Authors
Recent
Search
2000 character limit reached

Release Date Optimization Using Clearing Functions in MRP

Published 24 Feb 2025 in eess.SY and cs.SY | (2503.01862v2)

Abstract: This paper integrates a clearing function (CF)-based release planning approach into Material Requirements Planning (MRP) to address its limitations in modeling capacity constraints and dynamic lead times. The proposed CF-based optimization model replaces MRP's backward scheduling step while preserving its overall structure. Performance is evaluated through simulation experiments on two flow shop systems: a compact three-level system with three shared resources (PS1) and a more complex four-stage system with 32 end items and 16 machines (PS2). The experiments explore a range of demand uncertainties and utilization levels. Results show that CF-based planning consistently reduces total costs and tardiness while improving schedule feasibility, particularly under imperfect forecasts. These findings demonstrate the potential of CFs to enhance MRP by introducing workload responsiveness and dynamic adaptability, without compromising computational tractability.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.