An efficient optimization procedure for location-inventory problems with (S-1, S) policy and retrial demands

DOI10.1016/j.matcom.2022.12.010OpenAlexW4312055497MaRDI QIDQ6102663

Fong-Fan Wang

Publication date: 23 June 2023

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2022.12.010

zbMATH Keywords

GAlocation-inventoryretrial demandcapacity designbase stock

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion
• Base stock policy with retrial demands
• A coordinated location-inventory model
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection
• Numerical analysis of \((s, S)\) inventory systems with repeated attempts
• A perishable inventory system with retrial demands and a finite population
• Retrial Queues
• Inventory models with a mixture of backorders and lost sales

This page was built for publication: An efficient optimization procedure for location-inventory problems with (S-1, S) policy and retrial demands