Very high density storage systems

IIE Transactions (Institute of Industrial Engineers)

Volumn 38, Issue 1, 2006, Pages 79-90

  Gue, Kevin R ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATERIALS HANDLING; MATHEMATICAL MODELS; OPTIMIZATION; STORAGE (MATERIALS); WAREHOUSES;

RECTANGULAR STORAGE SPACES; STORAGE DENSITY; STORAGE SYSTEMS;

INDUSTRIAL ENGINEERING;

EID: 28944433065     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170500247352     Document Type: Article

References (18)

1. Alzoubi, K. and Wan, P. and Frieder, O. (2002) Distributed heuristics for connected dominating sets in wireless ad hoc networks Journal of Communications and Networks, 4(1), pp. 1 - 8.
2. Askin, R. and Standridge, C. (1993) Modeling and Analysis of Manufacturing Systems. New York NY: Wiley.
3. Bassan, Y. and Roll, Y. and Rosenblatt, M. (1980) Internal layout design of a warehouse IIE Transactions, 12(4), pp. 317 - 322. [CSA]
4. De Castilho, B. and Daganzo, C. (1993) Handling strategies for import containers at marine terminals Transportation Research, Part B, 27(2), pp. 151 - 166. [CSA] [CROSSREF]
5. Duckworth, W. (2002) Minimum connected dominating sets of random cubic graphs The Electronic Journal of Combinatorics, 9, pp. 1 - 13. [CSA]
6. Frazelle, E. (2002) World-Class Warehousing and Material Handling. New York NY: McGraw Hill.
7. Fujie, T. (2003) An exact algorithm for the maximum leaf spanning tree problem Computers & Operations Research, 30(13), pp. 1931 - 1944. [CSA] [CROSSREF]
8. Fujie, T. (2004) Private correspondence with the author.
9. Galbiati, G. and Maoli, F. and Morzenti, A. (1994) A short note on the approximability of the maximum leaves spanning tree problem Information Processing Letters, 52, pp. 45 - 49. [CSA] [CROSSREF]
10. Garey, M. and Johnson, D. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. New York NY: Freeman and Company.
11. Heragu, S.(1997) Facilities Design, 1st edn.. Boston MA: PWS Publishing Company.
12. Iranpour, R. and Tung, D. (1989) Methodology for optimal design of a parking lot Journal of Transportation Engineering, 115(2), pp. 139 - 160. [CSA]
13. Kim, K. and Kim, H. (2002) The optimal sizing of the storage space and handling facilities for import containers Transportation Research, Part B, 36, pp. 821 - 835. [CSA] [CROSSREF]
14. Kim, K. and Park, K. (2003) A note on a dynamic space-allocation method for outbound containers European Journal of Operational Research, 148, pp. 92 - 101. [CSA] [CROSSREF]
15. Lu, H. and Ravi, R. (1998) Approximating maximum leaf spanning trees in almost linear time Journal of Algorithms, 29, pp. 132 - 141. [CSA] [CROSSREF]
16. Solis-Oba, S. (1998) 2-approximation algorithm for finding a spanning tree with maximum number of leaves Lecture Notes in Computer Science, 1461, pp. 441 - 452. [CSA]
17. Taleb-Ibrahimi, M. and de Castilho, B. and Daganzo, C. (1993) Storage space vs handling work in container terminals Transportation Research, Part B, 27(1), pp. 13 - 32. [CSA] [CROSSREF]
18. Wehrfritz, G. and Itoi, K. (2003) Subterranean city. Newsweek.