An Improved WAGNER-WHITIN Algorithm
Authors
Abstract:
We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model of this paper considers WWA when backlogging, inventory holding and set-up costs cannot be fixed. The preliminary results also indicate that the execution time for the proposed method is approximately linear in the number of periods in the planning-horizon .
similar resources
an improved wagner-whitin algorithm
we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model ...
full textRobust Wagner–Whitin algorithm with uncertain costs
In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...
full textOn the Wagner-Whitin Lot-Sizing Polyhedron
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derive an O(n) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, a...
full textWorst Case Analysis of Forward Wagner Whitin Algorithm with Rolling Horizons
In this paper, we analyze the performance guarantee of the forward Wagner-Whitin algorithm with rolling horizons. We establish several properties for the solution returned by the algorithm and show that the ratio of the heuristic solution to the optimal cost is bounded above by the degree of speculative motive. Further, we show that the bound is actually tight.
full textEchelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem
An arborescent distribution system is a multi-level system in which each installation receives input from a unique immediate predecessor and supplies one or more immediate successors. In this paper, it is shown that a distribution system with an arborescent structure can also be modelled using an echelon stock concept where at any instant the total echelon holding cost is accumulated at the sam...
full textAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
full textMy Resources
Journal title
volume 20 issue 3
pages 117- 123
publication date 2009-09
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023