EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2193. The Joint Replenishment Problem with Permissible Delay in Payments and Resource Constraints under Power-of-Two Policy
Invited abstract in session MA-49: Lot-sizing with joint replenishment and routing decisions, stream Lot Sizing, Lot Scheduling and Production Planning.
Monday, 8:30-10:00Room: M1 (building: 101)
Authors (first author is the speaker)
| 1. | Jen-Yen Lin
|
Abstract
The Jointly Replenishment Problem (JRP) is concerned with determining lot sizes and scheduling replenishment times for $n$ products to minimize total costs per unit time.
In practice, consolidating replenishments to share common setup costs is crucial. Additionally, researchers often introduce constraints to enhance the applicability of inventory systems.
Examples include the adoption of a power-of-two (PoT) policy for streamlined scheduling, imposing minimum order quantities for commitment, and enforcing maximum shipment sizes based on capacity constraints.
In this paper, we explore JRP models incorporating the PoT policy and bounds for replenishment time. We provide a theoretical analysis of these models,
propose a search algorithm to identify global optimal solutions, analyze the complexity of the algorithm, and conduct randomized experiments to validate our approach.
By addressing these issues, our work contributes to the advancement of JRP models, offering practical insights and solutions that accommodate real-world constraints and enhance operational efficiency.
Keywords
- Supply Chain Management
- Complexity and Approximation
Status: accepted
Back to the list of papers