Solutions to real-world instances of PSPACE-complete stacking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 729-740

  König, Felix G ^a   Lübbecke, Macro ^a   Möhring, Rolf ^a   Schäfer, Guido ^a   Spenke, Ines ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; KNOWLEDGE BASED SYSTEMS; LARGE SCALE SYSTEMS; PROBLEM SOLVING;

ALGORITHMIC CHALLENGES; COMPLEX STACKING PROBLEM; STORAGE PLANNING;

REAL TIME SYSTEMS;

EID: 38049000413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_64     Document Type: Conference Paper

References (15)

1. Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific (1996)
2. Bertsekas, D.P., Tsitsiklis, J.N., Wu, C.: Rollout algorithms for combinatorial optimization. Journal of Heuristics 3(3), 245-262 (1997)
3. Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: Proceedings of the 14th National Conference on AI, pp. 714-719 (1997)
4. Cull, P., Ecklund, E.F.: Towers of hanoi and analysis of algorithms. The American Mathematical Monthly 90, 407-420 (1985)
5. Dekker, R., Voogd, P., van Asperen, E.: Advanced methods for container stacking. OR Spectrum 28, 563-586 (2006)
6. Fox, M., Long, D.: Progress in AI planning research and application. CEPIS 3, 10-25 (2002)
7. Hansen, J., Clausen, J.: Crane scheduling for a plate storage. Technical Report 1, Informatics and Mathematical Modelling, Technical University of Denmark (2002)
8. Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343(1-2), 72-96 (2005)
9. Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation 180, 71-81 (2003)
10. McDermott, D.: A heuristic estimator for means ends analysis in planning. In: Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, pp. 142-149 (1996)
11. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2), 177-192 (1970)
12. Steenken, D., Voß, S., Stahlbock, R.: Container terminal operation and operations research - a classification and literature review. OR Spectrum 26, 3-49 (2004)
13. Tang, L., Liu, J., Rong, A., Yang, Z.: Modelling and a genetic algorithm solution to the slab stack shuffling problem in implementing steel rolling schedulings. International Journal of Production Research 40(7), 1583-1595 (2002)
14. http://www.psi-bt.com
15. Walsh, T.: The towers of hanoi revisited, moving the rings by counting the moves. Information Processing Letters 15(2), 64-67 (1982)