Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs

被引:19
作者
Agra, A
Constantino, M [1 ]
机构
[1] Univ Lisbon, Fac Ciencias, Ctr Invest Operac, P-1749 Lisbon, Portugal
[2] Univ Lisbon, Fac Ciencias, Dept Estatist & Invest Operac, P-1749 Lisbon, Portugal
关键词
lotsizing problem; Wagner-Whitin cost; extended formulation; polyhedral combinatoric; mixed integer programming;
D O I
10.1016/S0167-6377(99)00030-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We examine the uncapacitated single-item lotsizing problem with backlogging and start-up costs where Wagner-Whitin costs are assumed. We generalize some theoretical results obtained in [5] for the polyhedral description of the convex hull of feasible solutions for models that can be viewed as particular cases of the one treated in this paper (models without start-up costs and models where backlog is not allowed). In the presence of Wagner-Whitin costs (which satisfy p(t) + (h) over tilde(t)(+) - p(t+1) greater than or equal to 0, for 0 less than or equal to t less than or equal to n - 1, and p(t+1) + (h) over tilde(t)(-) - p(t) greater than or equal to 0, for 1 less than or equal to t less than or equal to n, where p(t), (h) over tilde(t)(+) and (h) over tilde(t)(-) are the unit production, storage and backlogging costs; in the case that unit production costs are constant over time, the Wagner-Whitin assumption corresponds to non-negative holding costs and backlogging costs) we present a linear extended formulation with O(n) variables and O(n(2)) constraints. By projection, we obtain a linear formulation in the original space of variables with an exponential number of constraints. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:81 / 88
页数:8
相关论文
共 8 条
[1]  
AGRA A, 1997, 597 CIO U LISB
[2]  
Ford L. R, 1962, FLOWS NETWORKS
[3]  
KOLEN AWJ, 1992, OPER RES S1, V40, P145
[4]  
Nemhauser GL, 1988, INTEGER COMBINATORIA
[5]   POLYHEDRA FOR LOT-SIZING WITH WAGNER-WHITIN COSTS [J].
POCHET, Y ;
WOLSEY, LA .
MATHEMATICAL PROGRAMMING, 1994, 67 (03) :297-323
[6]  
POCHET Y, 1995, DIMACS SERIES DISCRE, V20, P245
[7]  
van Hoesel C., 1991, THESIS ER U
[8]   MINIMUM CONCAVE COST FLOWS IN CERTAIN NETWORKS [J].
ZANGWILL, WI .
MANAGEMENT SCIENCE, 1968, 14 (07) :429-450