Robust multi-item newsboy models with a budget constraint

International Journal of Production Economics

Volumn 66, Issue 3, 2000, Pages 213-226

  Vairaktarakis, George L ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INVENTORY CONTROL; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; PROCESS ENGINEERING; PURCHASING; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

ECONOMIC ORDER QUANTITY (EOQ) MODELS; LINEAR TIME ALGORITHMS; MULTI-ITEM NEWSBOY MODELS;

PRODUCTION CONTROL;

EID: 0034691450     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00129-2     Document Type: Article

References (23)

1. S. Nahmias, Production and Operations Analysis, Irwin, IL, 1989.
2. E. Silver, R. Peterson, Decision Systems for Inventory Management and Production Planning, 2nd Edition, Wiley, New York, 1985.
3. W. Stevenson, Production/Operations Management, 4th Edition, Irwin, Homewood, IL, 1993.
4. Gallego G., Moon I. The distribution free newsboy problem: Review and extensions. Journal of the Operational Society. 44(8):1993;825-834.
5. Moon I., Gallego G. Distribution free procedures for some inventory models. Journal of the Operational Research Society. 45(6):1994;651-658.
6. Moon I., Choi S. Distribution free procedures for make to order (MTO), make in advance (MIA), and composite policies. International Journal of Production Economics. 42:1997;21-28.
7. Gallego G. A minimax distribution free procedure for the. (Q,R) inventory model Operations Research Letters. 11:1992;55-60.
8. Gallego G. New bounds and heuristics for. (Q,R) policies Management Science. 44(2):1996;219-233.
9. Kasugai H., Kasegai T. Characteristics of dynamic maxmin ordering policy. Journal of the Operations Research Society of Japan. 3:1960;11-26.
10. Kasugai H., Kasegai T. Note on minimax regret ordering policy-static and dynamic solutions and a comparison to maxmin policy. Journal of the Operations Research Society of Japan. 3:1961;155-169.
11. P. Kouvelis, G. Vairaktarakis, G. Yu, Robust 1-median location on trees in the presence of demand and transportation cost uncertainty, Research Report, ISE Department, University of Florida, 1994.
12. Vairaktarakis G., Kouvelis P. Incorporating dynamic aspects and uncertainty in 1-median location problems. Naval Research Logistics. 46:1999;147-168.
13. Daniels R., Kouvelis P. Robust scheduling to hedge against processing time uncertainty in single stage production. Management Science. 41(2):1995;363-376.
14. P. Kouvelis, R. Daniels, G. Vairaktarakis (2000). The 2-machine robust flowshop with processing time uncertainty, IIE Transactions, forthcoming.
15. G. Yu, Robust economic order quantity models, European Journal of Operational Research 100 (3)(1997) 482-493.
16. Fisher M., Raman A. Reducing the cost of demand uncertainty through accurate response to early sales. Operations Research. 44(1):1996;87-99.
17. J. Hammond, A. Raman, Sport Obermeyer, Ltd., Harvard Business School Publishing, Boston, MA, 1996.
18. G. Hadley, T. Whitin, Analysis of Inventory Systems, Prentice-Hall, Englewood Cliffs, NJ, 1963.
19. Rosenblatt M. Multi-item inventory systems with budgetary constraint: A comparison between the Lagrangian and the fixed cycle approach. International Journal of Production Research. 19:1981;331-339.
20. Dantzig G.B. Discrete variable extremum problems. Operations Research. 5:1957;266-277.
21. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, England, 1990.
22. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Operations Research. 28:1980;1130-1154.
23. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, 1979.