Now showing items 1-4 of 4
A transportation type aggregate production model with bounds on inventory and backordering
We consider a certain T period aggregate production planning model, where the two sources of production are regular and overtime. The model allows for time varying production, holding and backordering costs and includes ...
An algorithmic proof of the polyhedral decomposition theorem
(John Wiley & Sons, 1988)
It is well‐known that any point in a convex polyhedron P can be written as the sum of a convex combination of extreme points of P and a non‐negative linear combination of extreme rays of P. Grötschel, Lovász, and Schrijver ...
A sequential dual simplex algorithm for the linear assignment problem
We present a sequential dual-simplex algorithm for the linear problem which has the same complexity as the algorithms of Balinski [3,4] and Goldfarb : O(n2) pivots, O(n2 log n + nm) time. Our algorithm works with the ...
A heuristic procedure for a single-item dynamic lot sizing problem
(Pergamon Press, 1988)
An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning ...