An efficient search algorithm for obtaining the optimal replenishment strategies in multi-stage just-in-time supply chain systems

DOI10.3934/JIMO.2009.5.11MaRDI QIDQ1013440zbMATH OpenOpenAlexFDO

Authors Ming-Jong Yao, Tien-Cheng Hsu

Publication date 20 April 2009

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2009.5.11

zbMATH Keywords

just-in-timeKanbansupply chain

Mathematics Subject Classification ID

Numerical algorithms for specific classes of architectures (65Y10) Inventory, storage, reservoirs (90B05)

Recommendations

• An efficient optimal solution method for the joint replenishment problem
• A New Optimal Algorithm for the Joint Replenishment Problem
• An efficient algorithm for a generalized joint replenishment problem
• On optimal algorithms for the joint replenishment problem
• Simulation-based optimization of replenishment policy in multi-echelon supply chain
• An efficient optimal solution method for the joint replenishment problem with minimum order quantities
• An Optimal Method for a Deterministic Joint Replenishment Inventory Policy in Discrete Time
• Efficient algorithms for the joint replenishment problem with minimum order quantities
• Efficient methods for stochastic joint replenishment and delivery problem
• An efficient polynomial-time approximation scheme for the joint replenishment problem

Cited in

(1)

• Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy

This page was built for publication: An efficient search algorithm for obtaining the optimal replenishment strategies in multi-stage just-in-time supply chain systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013440)