An efficient algorithm for a generalized joint replenishment problem

Article Abstract:

An algorithm originally developed by R Dekker, JBG Frenk and RE Wildeman to determine the optimal cyclic maintenance frequencies in multi-component systems was found useful in providing solutions to multi-inventory problems with general cost rate functions and service level constraints. In addition, the efficient algorithm can be used to solve generalized joint replenishment problems. Evaluation of its performance shows that the algorithm provides better quality of solution and running time as compared to other solution methods.

Inventory Control, Research, Usage, Algorithms, Materials management

---

An efficient optimal solution method for the joint replenishment problem

Article Abstract:

A solution procedure for the joint replenishment problem was developed based on Lispschitz optimization involving the the dynamic Lipschitz constant. The efficient optimal solution method for the joint replenishment problem utilized Lipschitz optimization to generate a solution with an arbitrarily small deviation from an optimal value. The novel heuristics also involve enumeration which required exponentially growing running times in the continuous-time case.

Production Planning & Control, Models, Production management, Production control, Mathematical optimization, Optimization theory

---

Similar abstracts:

• Abstracts: Ant algorithms for a time and space constrained assembly line balancing problem. Heuristics for matrix bandwidth reduction
• Abstracts: A heuristic algorithm for the truckload and less-than-truckload problem
• Abstracts: A tabu search Hooke and Jeeves algorithm for unconstrained optimization. A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization
• Abstracts: The single-vendor single-buyer integrated production-inventory model with a generalised policy. Inventory control with indivisible units of stock transfer

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.