The multiscenario lot size problem with concave costs

European Journal of Operational Research

Volumn 156, Issue 1, 2004, Pages 162-182

  Gutierrez J ^a   Puerto, J ^b   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Inventory; Multiple objective programming; Scenarios

Indexed keywords

ALGORITHMS; COSTS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; VECTORS;

INVENTORY; MULTIPLE OBJECTIVE PROGRAMMING; SCENARIOS;

INVENTORY CONTROL;

EID: 1242298469     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00014-6     Document Type: Conference Paper

References (29)

1. Alves M.J., Climaco J. An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound. European Journal of Operational Research. 124:2000;478-494.
2. Bellman R., Dreyfus S.E. Applied Dynamic Programming. 1961;Princeton University Press, Princeton, NJ.
3. Ehrgott M., Gandibleux X. An annotated bibliography of multicriteria combinatorial optimization. OR-Spektrum. 22:2000;425-460.
4. Fernández E., Puerto J. The multiobjective solution of the uncapacitated plant location problem. European Journal of Operational Research. 145:2003;509-529.
5. Fernández F.R., Nickel S., Puerto J., Rodriguez-Chia A. Robustness of the Pareto-solution for the multicriteria minisum location problem. Journal of Multicriteria Decision Analysis. 10:2001;191-203.
6. Gandibleux X., Jaszkiewicz A., Freville A., Slowiñski R. Multi-objective Methaheuristics. Journal of Heuristics. 6(3):2000;291-431. (special issue).
7. P. Horner, Planning under Uncertainty, Question & Answers with G. Dantzig, OR/MS Today, October 1999, pp. 26-30.
8. Klamroth K., Wiececk M. Dynamic programming approach to the multiple criteria Knapsack problem. Naval Research Logistics. 47:2000;57-76.
9. Manne A.S. Programming of economic lot sizes. Management Science. 4:1958;115-135.
10. Manne A.S., Veinott A.F. Jr. Manne A.S. Investments for Capacity Expansion: Size, Location and Time-Phasing. 1967;MIT Press, Cambridge, MA. (Chapter 11).
11. Morin T.L., Esoboque A.M.O. The imbedded state space approach to reducing dimensionality in dynamic programs of higher dimensions. Journal of Mathematical Analysis and Applications. 48:1974;801-810.
12. Nemhauser G.L. Introduction to Dynamic Programming. 1966;John Wiley and Sons, New York.
13. Puerto J., Fernández F.R. Multicriteria Weber location problems. Journal of the Multicriteria Decision Analysis. 18:1999;268-280.
14. Ramesh R., Zionts S., Karwan M. A class of practical interactive branch and bound algorithms for multicriteria integer programming. European Journal of Operational Research. 26:1986;161-172.
15. Rasmussen L.M. Zero-one programming with multiple criteria. European Journal of Operational Research. 26:1986;83-95.
16. Rodriguez-Chia A.M., Puerto J. A multicriteria competitive Markov decision process. Mathematical Methods of Operational Research. 55:2002;359-369.
17. Ruhe G. Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh. Zeitschrift für Operations Research. 32:1988;9-27.
18. Steuer R.E. Multiple Criteria Optimization: Theory, Computation, and Application. 1986;John Wiley and Sons, New York.
19. Ulungu E.L., Teghem J. Multi-objective combinatorial optimization problems: A survey. Journal of Multi-criteria Decision Analysis. 3:1994;83-104.
20. Veinott A.F. Jr. Production planning with convex costs: A parametric study. Management Science. 10:1964;441-460.
21. Villarreal M., Karwan H., Zionts S. An interactive branch and bound procedure for multicriterion integer linear programming. Fandel G., Gal T. Multiple Criteria Decision Making Theory and Application, Lecture Notes in Economics and Mathematical Systems 177. 1980;448-467 Springer, Berlin.
22. Villarreal M., Karwan H. Multicriteria dynamic programming with an application to the integer case. Journal of Optimization Theory and Applications. 38(1):1982;43-69.
23. Wagelmans A., Hoesel S.V., Kolen A. Economic lot sizing: An O(. n log n ) algorithm that runs in linear time in the Wagner-Whitin case Operations Research. 40:1992;145-155.
24. Wagner H.M., Whitin T. Dynamic Problems in the Theory of the Firm. Whitin T. Theory of Inventory Management. second ed. 1957;Princeton University Press, Princeton, NJ.
25. Zangwill W.I. A deterministic multi-period production scheduling model with backlogging. Management Science. 13:1966;105-119.
26. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science. 14:1968;429-450.
27. Zangwill W.I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach. Management Science. 15:1969;506-527.
28. Zionts S. A survey of multiple criteria integer programming methods. Annals of Discrete Mathematics. 5:1979;389-398.
29. Zionts S., Wallenius J. Identifying efficient vectors: Some theory and computational results. Operations Research. 23:1980;785-793.