Decision support for packing in warehouses

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

Volumn 4263 LNCS, Issue , 2006, Pages 115-124

  Ertek, Gürdal ^a   Kilic, Kemal ^a  

^a SABANCI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION SUPPORT SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING; PROJECT MANAGEMENT; VIRTUAL REALITY; WAREHOUSES;

BEAM SEARCH ALGORITHMS; LOADING PROBLEMS; MULTIPLE BIN SIZED BIN PACKING PROBLEMS;

CHIP SCALE PACKAGES;

EID: 33845251583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11902140_14     Document Type: Conference Paper

References (15)

1. Akturk, M.S., Kilic, K.: Generating short-term observation schedules for space mission projects. Journal of Intelligent Manufacturing, 10(5), (1999) 387-404
2. Bisckhof, E. E., Wascher, G.: Cutting and packing. European Journal of Operational Research. 84, (3) (1995) 503-505
3. Brunetta, L., Grégoire, P. A.: General purpose algorithm for three-dimensional packing. INFORMS Journal on Computing. 17, (3) (2005) 328-338
4. Chung, F., Graham, R. and Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. ACM Symposium on Parallel Algorithms and Architectures, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, Barcelona, Spain (2004) 103-111
5. Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research. 44, (1990) 145-159
6. Dyckhoff, H., Finke, U.: Cutting and Packing in Production and Distribution. Springer Verlag, Berlin (1992)
7. Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and Packing. Annotated Bibliographies in Combinatorial Optimization. Dell'Amico, M., Maffioli F., and Martello, S. (eds) Wiley (1997) 393-412
8. Eley, M.: A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25 (2003) 45-60
9. Ivancic, N.J., Mathur, K., Mohanty, B.B.: An integer-programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing and Operations Management 2, (1989) 268-298
10. Lowerre, B.: The HARPY speech recognition system. Ph.D. Thesis, Carnegie Mellon University, PA (1976).
11. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research, 48 (2), (2000) 256-267
12. Ow, P. S., Morton, T. E.: Filtered beam search in scheduling. International Journal of Production Research. 26, (1988) 35-62
13. Pisinger, D.: A tree-search heuristic for the container loading problem. Ricerda Operativa. 28 (87), (1998) 31-48.
14. http://www.diku.dk/~pisinger/
15. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems, Working Paper No. 24. Otto von Guericke University, Magdeburg (2006)