Forward-reserve allocation in a warehouse with unit-load replenishments

European Journal of Operational Research

Volumn 111, Issue 1, 1998, Pages 98-113

  Van Den Berg, Jeroen P ^a,d   Sharp, Gunter P ^b   Gademann, A J R M ^a   Pochet, Yves ^c  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^d Berenschot   (Netherlands)

Author keywords

Integer programming; Linear programmizng; Production; Warehousing

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PERSONNEL; RESOURCE ALLOCATION; WAREHOUSES;

FORWARD-RESERVE ALLOCATION;

PRODUCTION ENGINEERING;

EID: 0032210121     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)80013-1     Document Type: Article

References (9)

1. J. Drury, Towards more efficient order picking, IMM Monograph No. 1, The Institute of Materials Management, Cranfield, UK, 1988.
2. S.T. Hackman, M.J. Rosenblatt, Allocating items to an automated storage and retrieval system, IIE Transactions 22 (1) (1990) 7-14.
3. E.H. Frazelle, S.T. Hackman, U. Passy, L.K. Platzman, The forward-reserve problem, in: T.A. Ciriani, R.C. Leachman (Eds.), Optimization in Industry 2, Wiley, 1994, pp. 43-61.
4. S.T. Hackman, L.K. Platzman, Near-optimal solution of generalized resource allocation problems with large capacities, Operations Research 38 (5) (1990) 902-910.
5. Y.A. Bozer, Optimizing throughput performance in designing order picking systems, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, GA, USA (1985).
6. S. Martello, P. Toth, Knapsack problems: Algorithms and computer implementations, Wiley, Chichester, UK, 1990.
7. N. Karmarkar, A new polynomial algorithm in linear programming, Combinatorica 4 (1984) 373-395.
8. S.M. Ross, Introduction to probability models, 5th ed., Academic Press, San Diego, CA, 1993.
9. E.L. Lawler, Combinatorial optimization: Networks and matroids, Holt, Rinehart and Winston, New York, 1976.