A new parallel approach for multi-dimensional packing problems

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

Volumn 2328, Issue , 2002, Pages 194-201

  Błazewicz, Jacek ^a,b   Walkowiak, Rafał ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b POLISH ACADEMY OF SCIENCES   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CUTTING; MATRIX ALGEBRA; VECTOR SPACES;

COMPUTATION TIME; COMPUTATIONAL RESULTS; CUTTING PROBLEMS; DATA REPRESENTATIONS; GEOMETRICAL ENTITIES; MULTI DIMENSIONAL; PACKING PROBLEMS; PIPELINE PROCESSING;

PIPELINE PROCESSING SYSTEMS;

EID: 84947577123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_21     Document Type: Conference Paper

References (9)

1. Błażewicz J., Walkowiak R.: A local search approach for two-dimensional cutting. OR Spectrum 17 (1995) 93–98.
2. Błażewicz J., Moret-Salvador A., Walkowiak R.: Tabu search for two-dimensional irregular cutting. ed.: Ribeiro C.C., Hansen P., Essays and Surveys in Metaheuristics, Kluwer (2001) (to appear).
3. Dolata L.: Vector processing for cutting problem (in Polish), Master Thesis (2000), Pozna n University of Technology, Pozna n.
4. Dowsland K.A., Dowsland W.B.: Solution approaches to irregular nesting problems. EJOR 84 (1995) 506–521.
5. Dowwsland K.A., Dowsland W.B, Bennel J.A.: Jostling for position: local improvement for irregular cutting patterns. J. of ORS 49 (1998) 647–658.
6. Dyckhoff H.: A typology of cutting and packing problems. EJOR 44 (1990) 145–159.
7. Goodman J. E., O’Rourke J. (ed.): Handbook of Discrete and Computational Geometry, CRC Press (1997), Boca Raton.
8. Oliveira J. F., Gomes M. A., Ferreira S. J.: Topos - A newconstructiv e algorithm for nesting problems. OR Spectrum 22 (2000) 263-284.
9. Samet H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990) Reading.