Closed-Form Approximations for Optimal (r, q) and (S, T) Policies in a Parallel Processing Environment

DOI10.1287/OPRE.2017.1623zbMATH Open1380.90008OpenAlexW3125139474MaRDI QIDQ4598653FDOQ4598653

Author name not available (Why is that?)

Publication date: 15 December 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/lkcsb_research/5831

zbMATH Keywords

asymptotic analysisheavy-traffic limitclosed-form solutions\((r,q)\) policyi.i.d. lead times

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited In (2)

• Exploiting Random Lead Times for Significant Inventory Cost Savings
• Spatial Capacity Planning

This page was built for publication: Closed-Form Approximations for Optimal (r, q) and (S, T) Policies in a Parallel Processing Environment

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