Puzzle-based storage systems

Naval Research Logistics

Volumn 54, Issue 5, 2007, Pages 556-567

  Gue, Kevin R ^a   Kim, Byung Soo ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

15 puzzle; Logistics; Storage systems; Warehousing

Indexed keywords

STORAGE SYSTEMS; WAREHOUSING SYSTEMS;

NUMERICAL METHODS; RANDOM PROCESSES; SYSTEMS ANALYSIS;

GAME THEORY;

EID: 34547678268     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20230     Document Type: Article

References (16)

1. G.W. Flake and E.B. Baum, Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants," Theor Comput Sci 270 (2002), 895-911.
2. M. Gardner, The mathematical puzzles of Sam Loyd, Dover Publications, Mineola, NY, 1959.
3. M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman and Company, New York, 1979.
4. R.U. Gasser, Harnessing computational resources for efficient exhaustive search, PhD Thesis, Swiss Federal Institute of Technology, Zürich, 1995.
5. K.R. Gue, Very high density storage systems, HE Trans, 38 (2006), 93-104.
6. R. Hayes, The Sam Loyd puzzle and assorted problems: An investigation of updateable arrays in functional programming, Master's thesis, University of Dublin, 2000.
7. R.A. Hearn and E.D. Demaine, PSPACE-completeness of sliding-block puzzles and other problems through the non-deterministic constraint logic model of computation, Theor Comput Sci, 343 (2005), 72-96.
8. J.E. Hopcroft, J.T. Schwartz, and M. Sharir, On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the 'warehouseman's problem', Int J Robotics Res, 4 (1984), 76-88.
9. W.W. Johnson and W.E. Story, Notes on the "15" puzzle, Am J Math, 2 (1879), 397-404. Publication of this issue was delayed until April, 1880.
10. F.R.W. Karlemo, On sliding block puzzles, J Comb Math Comb Comput, 34 (2000), 97-107.
11. 2 - 1)-puzzle, Inf Process Lett, 56 (1995), 23-28.
12. D. Ratner and M. Warmuth, Finding a shortest solution for the (n × n)-extension of the 15-puzzle is intractable, J Symbolic Comput, 10 (1990), 111-137.
13. A. Reinefeld, Complete solution of the eight-puzzle and the benefit of node ordering in IDA, IJCAI, 1993, pp. 248-253. Available at citeseer.ist.psu.edu/reinefeld93complete.html.
14. J. Slocum and D. Sonneveld, The 15 puzzle. The Slocum Puzzle Foundation, 257 South Palm Drive, Beverly Hills, CA, 2006.
15. P.G. Tait, Note on the theory of the "15 puzzle", Proc R Soc Edinb, 10 (1880), 664-665.
16. J. Tromp and R. Cilibrasi, Limits of Rush Hour logic complexity, 2005, Available at www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cs/0502068.