Abstract
An algorithm (or “policy”) is a rule that suppliers follow to generate orders. The output of these policies is a set of N-curves driven by the customer demands, N0(f). Policies that always yield non-negative orders (i.e., allow no cancellations) produce non-decreasing N-curves. They will be said to be “monotone”. Monotonicity is a desirable property in practical applications, and will be required of the algorithms developed in Chapter 5. We have already seen that monotonic algorithms avoid backorders (approximately) if (1.5) is satisfied (approximately) for all possible customer demands. This reliability condition will also be demanded of the proposed algorithms. The analysis of the bullwhip effect done in Chapter 4 is completely general, however. It applies to non-monotone and unreliable policies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Daganzo, C.F. (2003). Algorithms / Policies. In: A Theory of Supply Chains. Lecture Notes in Economics and Mathematical Systems, vol 526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18152-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-18152-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00288-8
Online ISBN: 978-3-642-18152-8
eBook Packages: Springer Book Archive