Jostling for position: Local improvement for irregular cutting patterns

Journal of the Operational Research Society

Volumn 49, Issue 6, 1998, Pages 647-658

  Dowsland, K A ^a   Dowsland, W B ^a   Bennell, J A ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Heuristic; Irregular cutting packing

Indexed keywords

ALGORITHMS; CUTTING; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PACKAGING;

IRREGULAR CUTTING; IRREGULAR PACKAGING; JOSTLE APPROACH;

HEURISTIC METHODS;

EID: 0032094735     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600563     Document Type: Article

References (17)

1. Milenkovic V and Daniels K (1992). Placement and compaction of non convex polygons for clothing manufacture. In: Wang CA (ed) Proceedings of the Fourth Canadian Conference on Computational Geometry. Memorial University of Newfoundland, St. John’s, Newfoundland, August 1992, pp 236-243.
2. Stoyan YG, Novozhilova MC and Kartashov AV (1993). Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. Working paper—Institute for Problems in Machinery, Ukranian Academy of Sciences.
3. Amaral C, Bernardo J and Jorge J (1990). Marker making using automatic placement of irregular shapes for the garment industry. Comp Graph 14: 41-46.
4. Coffman EG, Garey MR and Johnson DS (1984). Approximation algorithms for bin packing—an updated survey. In: Ausiello G et al (eds). Algorithm Design for Computer Systems Design. Springer Verlag: Vienna, pp 49-106.
5. Art RC (1996). An approach to the two-dimensional cutting stock problem. IBM Cambridge Scientific Center Report 36-Y08.
6. Böhme D and Graham A (1979). Practical experiences with semi-automatic and automatic partnesting methods. In: Kuo C et al (eds). Computer Applications in the Automation of Shipyard Operation and Ship Design III. North Holland: Amsterdam, pp 213-218.
7. Konopasek M (1981). Mathematical treatments of some apparel marking and cutting problems. US Department of Commerce Report 99-26-90857-10.
8. Adamowicz M and Albano A (1976). Nesting two dimensional shapes in rectangular modules. Comp Aided Design 8: 27-33.
9. Preparata FP and Shamos MI (1985). Computational Geometry—An Introduction. Springer Verlag: Berlin.
10. Cunninghame-Green R (1992). Cut out waste!. O.R. Insight 5(3): 4-7.
11. Li Z and Milenkovic V (1995). Compaction and separation algorithms for non-convex polygons and their applications. Eur JOplRes 84: 539-561.
12. Mahadevan A (1984). Optimisation in computer aided pattern packing. Ph.D. thesis, North Carolina State University.
13. Ghosh PK (1991). An algebra of polygons through the notion of negative shapes. CVGIP: Image Understanding 54: 119-144.
14. Bennell JA and Dowsland KA (1997). Packing polygons: dealing with the geometry. Working paper EMBS/1997/03, European Business Management School, University of Wales Swansea.
15. Oliveira JFC and Ferreira JAS (1993). Algorithms for nesting problems. In: Vidal RVV (ed). Applied Simulated Annealing, Lecture Notes in Economic and Mathemaical Systems 396. Springer Verlag: Berlin, pp 255-273.
16. Dowsland KA and Dowsland W (1993). Heuristic approaches to irregular cutting problems. Working Paper EBMS/1993/13, European Business Management School, University of Wales Swansea.
17. Oliveira JFC and Ferreira JAS (1997). Private Communication.