526
Views
34
CrossRef citations to date
0
Altmetric
ORIGINAL ARTICLES

Very high density storage systems

Pages 79-90 | Received 01 Sep 2004, Accepted 01 Jun 2005, Published online: 23 Feb 2007

References

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

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.