Enhancement of Theory of Constraints replenishment using a novel generic buffer management procedure (Q4468857): Difference between revisions

Latest revision as of 17:52, 6 June 2024

scientific article; zbMATH DE number 2073872

Language	Label	Description	Also known as
English	Enhancement of Theory of Constraints replenishment using a novel generic buffer management procedure	scientific article; zbMATH DE number 2073872

Statements

instance of

scholarly article

0 references

title

Enhancement of Theory of Constraints replenishment using a novel generic buffer management procedure (English)

0 references

0 references

0 references

0 references

International Journal of Production Research

0 references

publication date

11 June 2004

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/0020754031000065502

0 references

cites work

The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing

0 references

A Revision of the Power Approximation for Computing (s, S) Policies

0 references

Optimal inventory policies under service-sensitive demand

0 references

The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing

0 references

Tractable (Q, R) Heuristic Models for Constrained Service Levels

0 references

Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy

0 references

Identifiers

zbMATH Open document ID

1176.90041

0 references

DOI

10.1080/0020754031000065502

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4468857

@@ Property / full work available at URL @@
+https://doi.org/10.1080/0020754031000065502
+Normal rank
@@ Property / OpenAlex ID @@
+W2088487497
@@ Property / OpenAlex ID: W2088487497 / rank @@
+Normal rank
@@ Property / cites work @@
+The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing
+Normal rank
@@ Property / cites work @@
+A Revision of the Power Approximation for Computing (<i>s</i>, <i>S</i>) Policies
+Normal rank
@@ Property / cites work @@
+Optimal inventory policies under service-sensitive demand
+Normal rank
@@ Property / cites work @@
+The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
+Normal rank
@@ Property / cites work @@
+Tractable (<i>Q</i>, <i>R</i>) Heuristic Models for Constrained Service Levels
+Normal rank
@@ Property / cites work @@
+Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
+Normal rank