A network flow model for the capacitated lot-sizing problem

Omega

Volumn 27, Issue 2, 1999, Pages 275-284

  Armentano, Vinícius A ^a   França, Paulo M ^a   De Toledo, Franklina M B ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Branch and bound; Lot sizing; Network flows; Production planning; Setup time

Indexed keywords

COSTS; NUMERICAL METHODS; PRODUCTION CONTROL; SCHEDULING ALGORITHMS;

BRANCH AND BOUNDS; CAPACITATED LOT SIZING PROBLEM; LOT SIZING; MULTIPLE ITEMS; NETWORK FLOW MODEL; NETWORKS FLOWS; PRODUCTION PLANNING; SET-UP TIME; SINGLE- MACHINES;

BRANCH AND BOUND METHOD;

EID: 0033114751     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(98)00045-0     Document Type: Article

References (16)

1. Bitran G.R, Matsuo H Multi-item capacited lot-sizing problem. Manage Sci. 32:1986;350-359.
2. Diaby M, Bahl H.C, Karwan M.H, Zionts S Capacitated lot-sizing and scheduling by Lagrangean relaxation. Eur J Oper Res. 59:1992;444-458.
3. Diaby M, Bahl H.C, Karwan M.H, Zionts S A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Manage Sci. 38:1992;1329-1340.
4. Drexl A, Kimms A Lot sizing and scheduling - Survey and extensions. Eur J Oper Res. 99:1997;221-235.
5. Elmaghraby S The economic lot scheduling problem (ELSP): Review and extensions. Manage Sci. 24:1978;587-598.
6. Eppen G.D, Martin R.K Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res. 35:1987;832-848.
7. Evans J.R Network-based optimization algorithm for the capacitated multi-item lot sizing problem. Comput Oper Res. 9:1985;297-305.
8. Florian M, Lenstra J.K, Rinnoy Kan A.H.G Deterministic production planning: Algorithms and complexity. Manage Sci. 26:1980;669-679.
9. Jensen PA, Barnes JW. Network Flow Programming. New York: John Wiley and Sons, 1980.
10. Johnson LA, Montgomery DC. Operations Research in Production Planning, Scheduling and Inventory Control, New York: John Wiley and Sons, 1974.
11. Lozano S, Larraneta J, Onieva L Primal-dual approach to the single level capacitated lotsizing problem. Eur J Oper Res. 51:1991;354-366.
12. Maes J, McClain J.O, Van Wassenhove L.N Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur J Oper Res. 53:1991;131-148.
13. Salomon M, Kroon L.G, Kuik R, Van Wassenhove L.N Some extensions of the discrete lotsizing and scheduling problem. Manage Sci. 37(7):1991;801-812.
14. Souza KX, Armentano VA. Multi-Item Lot-Sizing by a Cross Decomposition Based Algorithm. Annals of Operations Research 1994, p. 50.
15. Trigeiro W.W, Thomas L.J, McClain J.O Capacitated lot sizing with setup times. Manage Sci. 35:1989;353-366.
16. van Roy T.J Cross decomposition for mixed integer programming. Math Program. 25:1983;46-63.