A study on the optimal inventory allocation for clinical trial supply chains

DOI10.1016/J.APM.2021.04.029zbMATH Open1481.90040OpenAlexW3165155296MaRDI QIDQ2247342FDOQ2247342

Authors: Meimei Zheng, Ningxin Du, Hui Zhao, Edward Huang, Kan Wu 

Publication date: 17 November 2021

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2021.04.029

Recommendations

• Planning for demand failure: a dynamic lot size model for clinical trial supply chains
• Optimal shipment policy with ordering constraint for multi items in healthcare industries
• Optimal inventory policy in hospitals: a supply chain model
• Optimization of distribution system for pharmaceutical cold-chain logistics based on new GSP standard
• Intelligent inventory management approaches for perishable pharmaceutical products in a healthcare supply chain

zbMATH Keywords

clinical trialsstochastic programmingsupply chain managementinventory allocation

Mathematics Subject Classification ID

Stochastic programming (90C15) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cites Work

• A stochastic programming approach for supply chain network design under uncertainty
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Title not available (Why is that?)
• A simultaneous inventory control and facility location model with stochastic capacity constraints
• The sample average approximation method for stochastic discrete optimization
• Introduction to stochastic programming.
• The price of fairness
• Lectures on Stochastic Programming
• Multicommodity Distribution System Design by Benders Decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The sample average approximation method applied to stochastic routing problems: a computational study
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
• The value of multistage stochastic programming in capacity planning under uncertainty
• A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• Strategic facility location: A review
• Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
• The impact of the secondary market on the supply chain
• The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
• Coordination mechanisms of supply chain systems
• Approximations of Dynamic, Multilocation Production and Inventory Problems
• Decomposition based hybrid metaheuristics
• Inventory sharing under decentralized preventive transshipments
• Supply chain design under uncertainty using sample average approximation and dual decomposition
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• A Combined Vehicle Routing and Inventory Allocation Problem
• Note—Effects of Centralization on Expected Costs in a Multi-Location Newsboy Problem
• Exact Analysis of Continuous Review (R,Q) Policies in Two-Echelon Inventory Systems with Compound Poisson Demand
• The dynamic transshipment problem
• Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments
• Exact approaches for static data segment allocation problem in an information network
• An Integrated Inventory Allocation and Vehicle Routing Problem
• Title not available (Why is that?)
• A Multiechelon Inventory Model with Fixed Replenishment Intervals
• A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
• A Simple Heuristic for Computing Nonstationary (s, S) Policies
• The Benders decomposition algorithm: a literature review
• Abstraction, reformulation, and approximation. 5th international symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2--4, 2002. Proceedings
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
• Capacitated Production Control with Virtual Lateral Transshipments
• The infinite horizon non-stationary stochastic multi-echelon inventory problem and near-myopic policies
• Stochastic project scheduling with hierarchical alternatives
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion

Cited In (5)

• Planning for demand failure: a dynamic lot size model for clinical trial supply chains
• End-to-end drug supply management in multicenter trials
• Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand
• Optimal logistics strategy to distribute medicines in clinics and hospitals
• A structured review of quantitative models of the pharmaceutical supply chain

This page was built for publication: A study on the optimal inventory allocation for clinical trial supply chains

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