Power Approximation for Computing (s, S) Policies Using Service Level
From MaRDI portal
Publication:3204297
Recommendations
- A Revision of the Power Approximation for Computing (s, S) Policies
- Determining optimal parameters for expediting policies under service level constraints
- Service Rate Control of Tandem Queues With Power Constraints
- scientific article; zbMATH DE number 4001840
- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- SERVICE LEVEL ANALYSIS OF (S - 1, S) INVENTORY POLICY FOR NEGATIVE BINOMIAL DISTRIBUTED FAILURES
- Service level approximations for multiechelon inventory systems
- Modelling the power supply network -- hardness and approximation
Cited in
(7)- The value of real time yield information in multi-stage inventory systems -- exact and heuristic approaches
- Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model
- An analysis of warehouse and distribution strategies. A case study
- On the \((R,s,Q)\) inventory model when demand is modelled as a compound Bernoulli process
- On the empirical performance of \((T, s, S)\) heuristics
- Inventory models with minimal service level constraints
- Cold supply chain design with environmental considerations: a simulation-optimization approach
This page was built for publication: Power Approximation for Computing (s, S) Policies Using Service Level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204297)